Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 14 — the Kelly mechanism belongs to class C

Proved
LiquidPoA.Kelly.kelly_mem_classC

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

For every number nnn of users, the Kelly mechanism, which allocates giKelly(s)=si/∑jsjg^{Kelly}_i(s)=s_i/\sum_j s_jgiKelly​(s)=si​/∑j​sj​ and charges piKelly(s)=sip^{Kelly}_i(s)=s_ipiKelly​(s)=si​, is a resource allocation mechanism in the sense of §2 (including footnote 5) and belongs to the class C\mathcal CC:

Kellyn satisfies the §2 axioms,Kellyn∈C.\text{Kelly}_n\ \text{satisfies the §2 axioms},\qquad \text{Kelly}_n\in\mathcal C.Kellyn​ satisfies the §2 axioms,Kellyn​∈C.

Membership in C\mathcal CC makes Lemma 4.3 applicable to Kelly, which gives the equality case of Lemma 4.2. Only the Kelly part of the paper's observation is stated; SH and E2-PYS are outside this mission.

Formalization Note Kelly's payment is pi(s)=sip_i(s)=s_ipi​(s)=si​ at every profile, including profiles with fewer than two positive entries. Class C\mathcal CC is read in each user's own signal, as the proof of Lemma 4.3 uses it.

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

/-- The Kelly part of the class-`𝒞` observation on p. 14, with Section 2's mechanism properties. -/
theorem kelly_mem_classC (n : ℕ) :
    IsRAMechanism (kelly n) ∧ InClassC (kelly n) := by sorry

end LiquidPoA.Kelly
Source
Caragiannis, Voudouris, The efficiency of resource allocation mechanisms for budget-constrained users, arXiv:1707.03551v3, pp. 4–5, mechanism properties; p. 14, class C observation
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