Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 2, p. 5 — a valuable positive-budget player rules out zero equilibrium

Proved
LiquidPoA.Kelly.kelly_zero_not_eq

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

If an admissible Kelly game has a player iii with positive budget cic_ici​ and vi(1)>vi(0)v_i(1)>v_i(0)vi​(1)>vi​(0), the all-zero signal vector is not an equilibrium:

ci>0,vi(1)>vi(0)⟹0∉eq(GKelly).c_i>0,\quad v_i(1)>v_i(0)\quad\Longrightarrow\quad 0\notin eq(G^{Kelly}).ci​>0,vi​(1)>vi​(0)⟹0∈/eq(GKelly).

A sufficiently small positive signal obtains the resource at a payment below both the budget and the player's gain in value. This identifies when the zero profile can matter in the full price-of-anarchy goal.

Formalization Note The value condition makes precise the paper's phrase “valuation function that takes positive values”; a positive constant valuation alone would not give a profitable deviation.

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

/-- Section 2, pp. 5–6: a player with positive budget and genuinely increasing value rules out zero equilibrium. -/
theorem kelly_zero_not_eq {n : ℕ} (G : RAGame n)
    (hG : G.IsAdmissible) (i : Fin n)
    (hc : 0 < G.c i) (hv : G.v i 0 < G.v i 1) :
    ¬ IsEquilibrium (kelly n) G 0 := by sorry

end LiquidPoA.Kelly
Source
Caragiannis, Voudouris, The efficiency of resource allocation mechanisms for budget-constrained users, arXiv:1707.03551v3, p. 5, paragraph preceding the definition of X_n
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