Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 9, pp. 22–23 — every unit-ranking game has a strong equilibrium that maximizes the total flow

Proved
FlowAllocGames.StrongEq.exists_strong_equilibrium_max_flow

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

flow-allocation-gamep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-stabilitystrong-equilibrium

Let Γ=(G,(bv),(ce))\Gamma = (G, (b_v), (c_e))Γ=(G,(bv​),(ce​)) be a flow allocation game on a finite directed multigraph with integral supplies and capacities, played with unit-ranking strategies. Then there is a strong equilibrium a\mathbf aa that maximizes the total amount of flow:

a is a strong equilibriumandFlow(a′)≤Flow(a)  for every unit-ranking profile a′.\mathbf a \text{ is a strong equilibrium} \quad\text{and}\quad \mathrm{Flow}(\mathbf a') \le \mathrm{Flow}(\mathbf a) \ \text{ for every unit-ranking profile } \mathbf a'.a is a strong equilibriumandFlow(a′)≤Flow(a)  for every unit-ranking profile a′.

Here Flow(a)=∑e∈Ef^e\mathrm{Flow}(\mathbf a) = \sum_{e\in E} \hat f_eFlow(a)=∑e∈E​f^​e​ is the total flow of the clearing state of a\mathbf aa, and a strong equilibrium is a unit-ranking profile from which no non-empty coalition has a joint unit-ranking deviation that strictly improves the utility of every member.

In particular strong equilibria always exist in unit-ranking games, and the price of stability of strong equilibria with respect to Flow\mathrm{Flow}Flow is 111.

Formalization Note. This is the first sentence of Theorem 9. Its second sentence — the strong equilibrium can be computed in polynomial time and represented in polynomial space — needs a model of computation and is not formalized; the threshold-ranking representation on which it rests is the milestone on threshold profiles. Coalitions are non-empty and deviations must again be unit-ranking, as in the model.

Preamble
import Mathlib
import Definitions.Def_FlowAllocGames_StrongEq_Model
Formal statement
namespace FlowAllocGames.StrongEq

open Finset

/-- Theorem 9 (arXiv:1908.01714v3, pp. 22–23), first sentence: every unit-ranking game has a strong
equilibrium whose total flow is maximal among all unit-ranking profiles. -/
theorem exists_strong_equilibrium_max_flow {V E : Type*} [Fintype V] [Fintype E] [DecidableEq V]
    (G : Game V E) : ∃ a : Profile E, G.IsStrongEquilibrium a ∧
      ∀ a' : Profile E, G.IsUnitRanking a' → G.flow a' ≤ G.flow a := by sorry

end FlowAllocGames.StrongEq
Source
arXiv:1908.01714v3, Theorem 9, pp. 22–23 (first sentence); proof pp. 23–24
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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