AFTD Auto-Formalizing Theoretical Domains

pandora_is_reservation

def

r is a vector of reservation values: for every box i, the expected excess E[(v_i - r_i)^+] of its value over r_i equals its opening cost c_i.

Statement

def pandora_is_reservation (inst : PandoraDeadlineInstance) (r : Fin inst.n → ℝ) : Prop
Defined in
arXiv:2610.13775 Section 3, Section 3.1 (reservation values of Weitzman's rule)
Verified
26 Oct 2026
Axioms
none listed
Built on 6
  • PandoraDeadlineInstanceAn instance of Pandora's problem with deadlines consisting of n boxes, each with a non-negative opening cost, a positive integer deadline,…
  • DiscreteDistA discrete probability distribution with finite support on non-negative real values, defined by a finite support set, non-negative…
  • AdaptivePolicyA fully adaptive search policy for Pandora's problem with n boxes, represented as a decision tree that at each step either stops or opens…
  • IsValidPolicyA policy is valid for a Pandora's problem instance with deadlines if it respects opening deadlines and never opens any box more than once.
  • IsPartiallyAdaptiveA search policy π : AdaptivePolicy n for Pandora's problem is partially adaptive if there exists a predetermined ordered list of boxes…
  • expectedUtilityDUSThe expected net utility of an adaptive policy π : AdaptivePolicy inst.n under deferred-until-stopping commitment on a Pandora's problem…
Used by 4

Lean source view module on GitHub

/-- `r` is a vector of reservation values: `E[(v_i - r_i)^+] = c_i` for every box. -/
def pandora_is_reservation (inst : PandoraDeadlineInstance) (r : Fin inst.n → ℝ) : Prop :=
  ∀ i, ∑ v ∈ (inst.dist i).support, (inst.dist i).prob v * max (v - r i) 0 = inst.cost i
See it in the graphDiscuss this resultChallenge it