Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (5.12) — after fair contention the mechanism is BIC, ex-post IR, matching-feasible, has nonnegative payments, and U(M^{n,m}_het) = (1 − 1/e) U(M̄^{n,m}_het)

Proved
ConsumerUtilityApprox.UnitDemand.eq_5_12

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

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

Let an instance have n,m≥1n,m\ge1n,m≥1 and independent values Vij∼FijV_{ij}\sim F_{ij}Vij​∼Fij​, 0<E[Vij]<∞0<\mathbb E[V_{ij}]<\infty0<E[Vij​]<∞. Let DDD be a mechanism description whose pre-contention mechanism Mˉhetn,m\bar M^{n,m}_{\mathrm{het}}Mˉhetn,m​ is ex-ante feasible (∑iqijalloc≤1\sum_iq^{\mathrm{alloc}}_{ij}\le1∑i​qijalloc​≤1), whose announced request probabilities are exact, Qij=qijalloc(Mˉhetn,m)Q_{ij}=q^{\mathrm{alloc}}_{ij}(\bar M^{n,m}_{\mathrm{het}})Qij​=qijalloc​(Mˉhetn,m​), and whose service probabilities are σj=(1−1/e)/cj\sigma_j=(1-1/e)/c_jσj​=(1−1/e)/cj​ with cjc_jcj​ from (5.11). Then the mechanism Mhetn,mM^{n,m}_{\mathrm{het}}Mhetn,m​ (requests, fair selection per item, service with probability σj\sigma_jσj​, payment only when served) is BIC, ex-post individually rational and matching-feasible in every realized outcome, has nonnegative payments in every realized outcome, and

U(Mhetn,m)=(1−1e)U(Mˉhetn,m).U(M^{n,m}_{\mathrm{het}})=\Big(1-\frac1e\Big)U(\bar M^{n,m}_{\mathrm{het}}).U(Mhetn,m​)=(1−e1​)U(Mˉhetn,m​).

Differences from the source:

  • encoding: a randomized mechanism with realized outcomes → RandMech: for each reported profile a PMF over (assignment, payments); BIC and U from its reduced form; reason: the mechanisms use finitely many random choices
  • generalization: M̄^{n,m}_het produced by the demand-weight procedure of §5.1.1 → every mechanism description of the family whose pre-contention mechanism is ex-ante feasible, with exact Q and σ_j = (1 − 1/e)/c_j; reason: the argument (Observation 1, (5.11)) uses only ex-ante feasibility and exact request probabilities; Lemma 6's M̄ is such a description
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_12 {n m : ℕ} (hn : 1 ≤ n) (hm : 1 ≤ m) (I : Instance n m)
    (D : MechDescription n m)
    (hfeas : D.preLaw.reduced.IsExAnteFeasible I)
    (hQ : ∀ i j, D.Q i j = D.preLaw.reduced.exAnteAlloc I i j)
    (hσ : ∀ j, D.σ j = (1 - Real.exp (-1)) / selectionConst D.Q j) :
    D.law.IsBIC I ∧ D.law.IsExPostIR ∧ D.law.IsMatchingFeasible ∧
      D.law.HasNonnegPayments ∧
      D.law.U I = (1 - Real.exp (-1)) * D.preLaw.U I := 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.12) (Appendix C.5, pp. 48–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