AFTD Auto-Formalizing Theoretical Domains

pandora_deadline_feasible

def

A set S of boxes is deadline-feasible if for every j at most j of its boxes have deadline at most j (equivalently, by Lemma 2, its boxes can be opened one per round by their deadlines).

Statement

def pandora_deadline_feasible (inst : PandoraDeadlineInstance) (S : Finset (Fin inst.n)) : Prop
Defined in
arXiv:2610.13775 Section 3, Section 3.1 and Lemma 2 (feasibility test)
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 7

Lean source view module on GitHub

/-- A set of boxes is deadline-feasible: for every `j`, at most `j` of its boxes have deadline `≤ j`. -/
def pandora_deadline_feasible (inst : PandoraDeadlineInstance) (S : Finset (Fin inst.n)) : Prop :=
  ∀ j : ℕ, (S.filter (fun i => inst.deadline i ≤ j)).card ≤ j
See it in the graphDiscuss this resultChallenge it