Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 — the fair allocation rule is Y(g)=φ(v/g)Y(g)=\varphi(v/g)Y(g)=φ(v/g), the Shapley value of the graph-restricted game

Proved
CooperationGraphs.FairRule.theorem_2

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

cooperation-graphscooperative-gamesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1shapley-value

Let v∈RCLv\in\mathbb R^{CL}v∈RCL be a game in characteristic function form and let Y:GR→RNY:GR\to\mathbb R^NY:GR→RN be the fair allocation rule for vvv, i.e. YYY satisfies the efficiency condition (7) and the equity condition (10). Then

Y(g)=φ(v/g)for all g∈GR,Y(g)=\varphi(v/g)\qquad\text{for all } g\in GR,Y(g)=φ(v/g)for all g∈GR,

where φ:RCL→RN\varphi:\mathbb R^{CL}\to\mathbb R^Nφ:RCL→RN is the Shapley value operator and (v/g)S=∑T∈S/gvT(v/g)_S=\sum_{T\in S/g}v_T(v/g)S​=∑T∈S/g​vT​ is the graph-restricted game. In particular, Y(gˉN)=φ(v)Y(\bar g^N)=\varphi(v)Y(gˉ​N)=φ(v).

The fair allocation rule is therefore computed by an explicit formula (later called the Myerson value), and at the complete graph it reduces to the Shapley value.

Formalization Note. The paper assumes a nonempty player set, stated as 0<n0<n0<n. "The unique fair allocation rule" is stated as "every fair allocation rule"; existence and uniqueness are Theorem 1. φ\varphiφ is the platform's Supermodularity.Cooperative.ShapleyValue applied after setting the game's value at ∅\emptyset∅ to 000. gˉN\bar g^Ngˉ​N is the complete graph ⊤.

Preamble
import Mathlib
import Definitions.Def_CooperationGraphs_FairRule_Basic
Formal statement
namespace CooperationGraphs.FairRule

open Finset
open scoped Classical

/-- Theorem 2 (p. 8): the fair allocation rule `Y` for `v` satisfies `Y(g) = φ(v/g)` for every
graph `g`; in particular `Y(ḡ^N) = φ(v)`. -/
theorem theorem_2 {n : ℕ} (hn : 0 < n) (v : Game n) (Y : Rule n) (hY : IsFair v Y) :
    (∀ g : SimpleGraph (Fin n), Y g = shapley (restrict v g)) ∧ Y ⊤ = shapley v := by sorry

end CooperationGraphs.FairRule
Source
Myerson, Graphs and Cooperation in Games, Discussion Paper No. 246 (Sept. 1976), Theorem 2, p. 8
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