Theorem 3.3 — exact two-sample threshold distribution
OpenSampleCRS.AlmostGreedy.Supplement.theorem_3_3contention-resolutionp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1probability
Let have total mass one. Draw the two independent sample rows and carry out Algorithm 2's actual threshold choices. Its threshold has exactly the law
The second equality includes and . This describes the algorithm's output law, rather than merely the existence of an ideal threshold or a balancedness consequence.
Differences from the source:
- encoding: elements 1,…,n and independent Bernoulli trials → Fin n and finite product-weight expectations; reason: the label shift is a bijection and the weights are exactly the independent Bernoulli law
- encoding: threshold 0 before all arrivals and thresholds 1,…,n → none and some i : Option (Fin n); reason: a separate sentinel preserves strict-after-threshold eligibility at the first arrival
Preamble
import Mathlib import Definitions.Def_SampleCRS_AlmostGreedy_Supplement_threshold
Formal statement
namespace SampleCRS.AlmostGreedy.Supplement
/-- Theorem 3.3, p.10. exact two-sample threshold distribution. -/
theorem theorem_3_3 {n : ℕ} (p : Fin n → ℝ) (hp : ValidProb p) (hmass : (∑ i, p i) = 1) :
threshold2Law p none = (1 / 2 : ℝ) ∧
∀ i : Fin n, threshold2Law p (some i) = p i / 2 := by sorry
end SampleCRS.AlmostGreedy.Supplement
Source
Shaddin Dughmi, Vasilis Livanos, Pranav Nuti, STOC 2027 submission #686 (October 2026), Theorem 3.3, p. 10