PandoraDeadlineInstance
An instance of Pandora's problem with deadlines consisting of n boxes, each with a non-negative opening cost, a positive integer deadline, and an independent discrete value distribution.
Statement
structure PandoraDeadlineInstance where n : ℕ cost : Fin n → ℝ deadline : Fin n → ℕ dist : Fin n → DiscreteDist cost_nonneg : ∀ i, 0 ≤ cost i deadline_pos : ∀ i, 1 ≤ deadline i
- Defined in
- arXiv:2610.13775, Sec. 2.1
- Verified
- 18 Oct 2026
- Axioms
- none listed
- Built on 1
- DiscreteDistA discrete probability distribution with finite support on non-negative real values, defined by a finite support set, non-negative…
- Used by 35
- two_box_pi01_validThe policy "open box 0, then box 1, then stop" is valid for the two-box instance.
- optDUSThe optimal expected net utility
optDUS instunder deferred-until-stopping commitment for a Pandora's problem instance with deadlines… - opt_dus_nonnegFor any Pandora deadline instance
inst,0 ≤ optDUS inst. - expected_utility_dus_le_opt_dusFor any Pandora's problem instance with deadlines
instand any valid policyπ,expectedUtilityDUS inst π ≤ optDUS inst. - pandora_is_reservationr 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…
- 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.
- 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.
- two_box_dtd_le_oneUnder deferred-to-deadline commitment, every valid policy on the two-box instance gets expected utility at most 1.
- two_box_valid_stop_of_mem_oneIf a valid policy execution has box 1 in its already-opened list and at least one round has elapsed, then the remaining policy is
stop. - expected_utility_dus_stopFor any Pandora deadline instance
inst, the expected net utilityexpectedUtilityDUS inst AdaptivePolicy.stopis zero. - not_single_box_valid_is_partially_adaptiveThe statement
single_box_valid_is_partially_adaptiveis false: The statement is false.IsValidPolicyonly constrains the continuation… - two_box_pi01_dusThe DUS utility of the policy opening box 0 then box 1 is
2 - 1/M. - two_box_deadline_instTwo boxes with zero cost: box 0 has deadline 1 and deterministic value 1; box 1 has deadline 2, value
Mwith probability1/Mand 0… - expected_utility_dtd_le_dusFor every Pandora's problem instance with deadlines
inst : PandoraDeadlineInstanceand every adaptive policy… - expectedUtilityDTDThe expected net utility of an adaptive policy
π : AdaptivePolicy inst.nunder deferred-to-deadline commitment on a Pandora's problem… - pandora_deadline_feasibleA 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…
- opt_dtd_le_opt_dusFor every Pandora's problem instance with deadlines
inst : PandoraDeadlineInstance, the optimal expected utility under… - pandora_deadline_feasible_emptySanity: the empty set of boxes is deadline-feasible.
- optDTDThe optimal expected net utility
optDTD instunder deferred-to-deadline commitment for a Pandora's problem instance with deadlines… - two_box_dtd_after_box_zeroWith the history
[(0, 1)], any valid policy has deferred-to-deadline expected utility at most 1. - is_valid_policy_stopFor every Pandora's problem instance with deadlines
inst : PandoraDeadlineInstance, the policyAdaptivePolicy.stopsatisfies… - op184_partially_adaptive_half_approximationFor every Pandora's problem instance with deadlines
inst : PandoraDeadlineInstance, there exists a valid partially adaptive policy… - pandora_threshold_policy_lower_boundLemma 3: for reservation values r, t >= 0 and a duplicate-free list of boxes each with positive capped surplus at t, the threshold policy…
- IsValidPolicyAuxA policy execution is valid if it never re-opens an already opened box, respects the deadline of each opened box, and remains valid on all…
- 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_capped_surplusThe reservation-capped threshold surplus of box i at threshold t: w_i(t) = E[(min(v_i, r_i) - t)^+].
- op182_deferred_to_deadline_beyond_half_against_stoppingRefutation of Open Problem OP-182 against the deferred-until-stopping benchmark: there does not exist any constant
c > 1/2such that for… - expectedUtilityDUSThe expected net utility of an adaptive policy
π : AdaptivePolicy inst.nunder deferred-until-stopping commitment on a Pandora's problem… - op182_deferred_to_deadline_beyond_half_self_benchmarkOpen Problem OP-182 against the deferred-to-deadline benchmark: there exists a constant
c > 1/2such that for every Pandora's problem… - dus_approx_of_pos_optIf a constant factor approximation ratio c is achieved by partially adaptive policies on all instances with optDUS > 0, then it is…
- two_box_counterexample_familyFor any integer
M > 1, there exists a 2-box Pandora deadline instance such that2 - 1 / M ≤ optDUS instand every valid policyπ… - pandora_threshold_policyThe threshold policy on a list of boxes: open them in the given order and stop as soon as an opened value exceeds t (stop after the last…
- pandora_exists_reservationEvery Pandora instance with deadlines has reservation values: for every box i there is r_i with E[(v_i - r_i)^+] = c_i.
- 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.
- pandora_threshold_policy_validA threshold policy on a duplicate-free list whose j-th box has deadline at least j is a valid policy and is partially adaptive.
Read back from the Lean
A structure representing an instance of Pandora's problem with deadlines (PandoraDeadlineInstance), comprising:
1. n : ℕ: a natural number representing the number of items/boxes.
2. cost : Fin n → ℝ: a function assigning a real-valued cost to each item i : Fin n.
3. deadline : Fin n → ℕ: a function assigning a natural number deadline to each item i : Fin n.
4. dist : Fin n → DiscreteDist: a function assigning to each item i : Fin n a discrete probability distribution over non-negative real numbers.
5. cost_nonneg : ∀ i : Fin n, 0 ≤ cost i: an assertion that the cost of every item is non-negative.
6. deadline_pos : ∀ i : Fin n, 1 ≤ deadline i: an assertion that the deadline of every item is at least 1 (strictly positive), with a default value of by sorry.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- An instance of Pandora's problem with deadlines. -/ structure PandoraDeadlineInstance where n : ℕ cost : Fin n → ℝ deadline : Fin n → ℕ dist : Fin n → DiscreteDist cost_nonneg : ∀ i, 0 ≤ cost i deadline_pos : ∀ i, 1 ≤ deadline i