AFTD Auto-Formalizing Theoretical Domains

pandora_capped_surplus

def

The reservation-capped threshold surplus of box i at threshold t: w_i(t) = E[(min(v_i, r_i) - t)^+].

Statement

noncomputable def pandora_capped_surplus (inst : PandoraDeadlineInstance) (r : Fin inst.n → ℝ)
    (i : Fin inst.n) (t : ℝ) : ℝ
Defined in
arXiv:2610.13775 Section 3, Section 3.1, definition of w_i(t)
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

/-- Reservation-capped threshold surplus `w_i(t) = E[(min(v_i, r_i) - t)^+]`. -/
noncomputable def pandora_capped_surplus (inst : PandoraDeadlineInstance) (r : Fin inst.n → ℝ)
    (i : Fin inst.n) (t : ℝ) : ℝ :=
  ∑ v ∈ (inst.dist i).support, (inst.dist i).prob v * max (min v (r i) - t) 0
See it in the graphDiscuss this resultChallenge it