Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.2, p. 13 — the bound in equation (6) and its equality case

Proved
LiquidPoA.Kelly.lemma_4_2

by mikedeng1 · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

budgetskelly-mechanismliquid-welfarep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchyresource-allocation

Let MMM be an nnn-player resource allocation mechanism, n≥2n\ge2n≥2, with allocation and payment functions gMg^MgM and pMp^MpM, and let

λ1M(s)=(∂g1M(y,s−1)∂y∣y=s1)−1⋅∂p1M(y,s−1)∂y∣y=s1.\lambda^M_1(s)=\Big(\frac{\partial g^M_1(y,s_{-1})}{\partial y}\Big|_{y=s_1}\Big)^{-1}\cdot\frac{\partial p^M_1(y,s_{-1})}{\partial y}\Big|_{y=s_1}.λ1M​(s)=(∂y∂g1M​(y,s−1​)​​y=s1​​)−1⋅∂y∂p1M​(y,s−1​)​​y=s1​​.

Then the liquid price of anarchy of MMM satisfies

LPoA(M)≤sup⁡s∈Xn∑i≥2piM(s)+λ1M(s)∑i≥2piM(s)+λ1M(s) g1M(s).(6)LPoA(M)\le\sup_{s\in\mathbb X_n} \frac{\sum_{i\ge2}p_i^M(s)+\lambda_1^M(s)}{\sum_{i\ge2}p_i^M(s)+\lambda_1^M(s)\,g_1^M(s)}.\tag{6}LPoA(M)≤s∈Xn​sup​∑i≥2​piM​(s)+λ1M​(s)g1M​(s)∑i≥2​piM​(s)+λ1M​(s)​.(6)

If, in addition, every s∈Xns\in\mathbb X_ns∈Xn​ is an equilibrium of the game GM(s,1)\mathcal G^M(s,1)GM(s,1), then (6) holds with equality.

The lemma turns upper and lower bounds on the liquid price of anarchy into the analysis of a single explicit expression in the signal vector, with no reference to valuations or budgets.

Formalization Note LPoA(M)LPoA(M)LPoA(M) is the supremum over all admissible games and all their equilibria, as on p. 6. The paper's proof restricts to equilibria in Xn\mathbb X_nXn​ by the claim of pp. 5–6 that no other signal vector is an equilibrium (up to games whose liquid welfare does not depend on the allocation); that claim uses the continuity of the payment at the zero vector, which is property 8 of the mechanism axioms. User 1 is index 000; n≥2n\ge2n≥2 makes it exist.

Preamble
import Mathlib
import Definitions.Def_LiquidPoA_Kelly_Setting
Formal statement
namespace LiquidPoA.Kelly

/-- Lemma 4.2, p. 13: the liquid price of anarchy is bounded by the supremum (6), with equality under the equilibrium condition. -/
theorem lemma_4_2 {n : ℕ} (hn : 2 ≤ n) (M : Mechanism n)
    (hM : IsRAMechanism M) :
    (lpoa M ≤ ⨆ (s : Fin n → ℝ) (_ : InX s),
      ratio M s (⟨0, by omega⟩ : Fin n)) ∧
    ((∀ s, InX s →
      IsEquilibrium M (worstGame M s (⟨0, by omega⟩ : Fin n)) s) →
      lpoa M = ⨆ (s : Fin n → ℝ) (_ : InX s),
        ratio M s (⟨0, by omega⟩ : Fin n)) := by sorry

end LiquidPoA.Kelly
Source
Caragiannis, Voudouris, The efficiency of resource allocation mechanisms for budget-constrained users, arXiv:1707.03551v3, p. 13, Lemma 4.2 and equation (6)
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 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