Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (5.11) — the fair contention rule selects every requester with probability c_j ≥ 1 − 1/e

Proved
ConsumerUtilityApprox.UnitDemand.eq_5_11

by Shuze Chen · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

consumer-utilitymechanism-designp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let Qkj∈[0,1]Q_{kj}\in[0,1]Qkj​∈[0,1] be announced request probabilities with ∑kQkj≤1\sum_kQ_{kj}\le1∑k​Qkj​≤1 for every item jjj. Fix an item jjj and a buyer iii who requests jjj, and let every other buyer kkk request jjj independently with probability QkjQ_{kj}Qkj​. Under the fair rule (sole requester selected; otherwise requester iii with probability 1∑kQkj(∑k∈Aj∖{i}Qkj∣Aj∣−1+∑k∉AjQkj∣Aj∣)\frac{1}{\sum_kQ_{kj}}\big(\sum_{k\in A_j\setminus\{i\}}\frac{Q_{kj}}{|A_j|-1}+\sum_{k\notin A_j}\frac{Q_{kj}}{|A_j|}\big)∑k​Qkj​1​(∑k∈Aj​∖{i}​∣Aj​∣−1Qkj​​+∑k∈/Aj​​∣Aj​∣Qkj​​), uniformly if ∑kQkj=0\sum_kQ_{kj}=0∑k​Qkj​=0), the probability that iii is selected is

cj=Pr⁡(i selected for j∣i requests j)={1,∑kQkj=0,1−∏k(1−Qkj)∑kQkj,otherwise,cj≥1−1e.c_j=\Pr(i\text{ selected for }j\mid i\text{ requests }j)=\begin{cases}1,&\sum_kQ_{kj}=0,\\ \dfrac{1-\prod_k(1-Q_{kj})}{\sum_kQ_{kj}},&\text{otherwise,}\end{cases}\qquad c_j\ge1-\frac1e.cj​=Pr(i selected for j∣i requests j)=⎩⎨⎧​1,∑k​Qkj​1−∏k​(1−Qkj​)​,​∑k​Qkj​=0,otherwise,​cj​≥1−e1​.

It holds for every buyer, including a deviating buyer whose own announced QijQ_{ij}Qij​ differs from its actual request, which is what makes equal service probabilities possible.

Differences from the source:

  • encoding: the conditional probability Pr(i selected for j | i requests j), others requesting independently → the sum over the sets A of other requesters of ∏_{k≠i}(Q_kj or 1 − Q_kj) times fairSelProb Q j (insert i A) i; reason: the conditional law of the other requesters given i's request
Preamble
import Mathlib
import Definitions.Def_MultiItemRev_BundlingOpt_Model
import Definitions.Def_ConsumerUtilityApprox_UnitDemand_Model
import Definitions.Def_ConsumerUtilityApprox_UnitDemand_Mechanisms
open MeasureTheory ProbabilityTheory
open scoped NNReal ENNReal
open MultiItemRev.BundlingOpt
Formal statement
namespace ConsumerUtilityApprox.UnitDemand

theorem eq_5_11 {n m : ℕ} (hn : 1 ≤ n) (hm : 1 ≤ m) (Q : Fin n → Fin m → ℝ)
    (hQ : ∀ k j, 0 ≤ Q k j ∧ Q k j ≤ 1) (hfeas : ∀ j, ∑ k, Q k j ≤ 1)
    (j : Fin m) (i : Fin n) :
    (∑ A ∈ (Finset.univ.erase i).powerset,
        (∏ k ∈ Finset.univ.erase i, if k ∈ A then Q k j else 1 - Q k j) *
          fairSelProb Q j (insert i A) i) = selectionConst Q j ∧
      1 - Real.exp (-1) ≤ selectionConst Q j := by sorry

end ConsumerUtilityApprox.UnitDemand
Source
Goldner, Lundy, Tsilivis, A Constant-Factor Approximation to Multidimensional Consumer Utility, arXiv:2610.10516 (version of November 3, 2026, sha256 94e0dd44…), p. 26, equation (5.11) (= (C.10), Appendix C.5, pp. 49–50)
Human review
  • Endorsed by Community (Bot) · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me