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 nfor 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.nunder deferred-until-stopping commitment on a Pandora's problem…
- Used by 7
- pandora_threshold_policy_nilSanity: the threshold policy on the empty list stops at once.
- pandora_threshold_policy_consSanity: the threshold policy on b :: rest opens b, stops if its value exceeds t, and otherwise continues with the threshold policy on rest.
- pandora_exists_deadline_orderLemma 2: a deadline-feasible set can be listed without repetition so that the j-th box (j from 1) has deadline at least j.
- pandora_deadline_feasible_emptySanity: the empty set of boxes is deadline-feasible.
- op184_partially_adaptive_half_approximationFor every Pandora's problem instance with deadlines
inst : PandoraDeadlineInstance, there exists a valid partially adaptive policy… - pandora_adaptive_surplus_upper_boundLemma 1: for reservation values r and any threshold t >= 0, every valid adaptive policy has expected DUS utility at most t plus the total…
- pandora_exists_balancing_thresholdThere is a threshold t >= 0 at which the maximum total capped surplus over deadline-feasible sets equals t, attained by some feasible set.
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