Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, PDF p. 3 — at a Nash equilibrium each agent uses only links minimizing c_i^j, and c_i = min_j c_i^j

Proved
WorstCaseEq.Identical.nash_support_minimizes

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

best-responsemixed-strategiesnash-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let nnn agents with traffics w1,…,wnw_1,\dots,w_nw1​,…,wn​ share m≥1m\ge1m≥1 identical links, and let p=(pij)p=(p_i^j)p=(pij​) be a Nash equilibrium. For an agent iii and a link jjj let cij=wi+∑k≠ipkjwkc_i^j=w_i+\sum_{k\neq i}p_k^jw_kcij​=wi​+∑k=i​pkj​wk​ be the cost of agent iii when its traffic is assigned to link jjj, as in (2). Then:

  1. agent iii assigns positive probability only to links minimizing cijc_i^jcij​: if pij>0p_i^j>0pij​>0 then cij≤cij′c_i^j\le c_i^{j'}cij​≤cij′​ for every link j′j'j′;
  2. the expected cost cic_ici​ of agent iii equals the minimum link cost,
ci=min⁡jcij.c_i=\min_j c_i^j .ci​=jmin​cij​.

This is the support description of equilibria in §2 of the paper. It justifies the paper's double use of cic_ici​, as the expected cost and as min⁡jcij\min_j c_i^jminj​cij​, which is how Theorem 2 is proved.

Formalization Note No sign condition on the traffics is needed. The minimum over links uses m≥1m\ge1m≥1.

Preamble
import Mathlib
import Definitions.Def_agt_games
import Definitions.Def_WorstCaseEq_Identical_Model
Formal statement
namespace WorstCaseEq.Identical

/-- Support property, §2, PDF p. 3: at a Nash equilibrium agent `i` puts positive probability only on
links `j` minimizing `c_i^j`, and its expected cost equals `c_i = min_j c_i^j`. -/
theorem nash_support_minimizes {n m : ℕ} [NeZero m] (w : Fin n → ℝ) (p : Fin n → Fin m → ℝ)
    (hp : IsNash w p) :
    (∀ i j, 0 < p i j → ∀ j', linkCost w p i j ≤ linkCost w p i j') ∧
      ∀ i, expCost w p i = Finset.univ.inf' Finset.univ_nonempty (linkCost w p i) := by sorry

end WorstCaseEq.Identical
Source
Koutsoupias & Papadimitriou, Worst-case equilibria (journal version, 2009), PDF p. 3, §2, paragraph after (2)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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