A Lean Formalization of the Shapley Value Characterization for Finite Cooperative Games
Version 1 / Oct 01, 2026 / CC BY 4.0
Abstract
We describe a Lean 4 formalization of the standard four-axiom characterization of the Shapley value for finite transferable-utility cooperative games. Games are arbitrary real-valued characteristic functions normalized at the empty coalition; the player type may itself be empty. The factorial coalition formula is proved efficient, symmetric for interchangeable players, null-player respecting, and additive. Uniqueness follows from the values of arbitrarily scaled unanimity games and an explicit Boolean-lattice Möbius decomposition. The proof requires neither a real-homogeneity axiom nor a continuity assumption on competing allocation rules. We explain the finite-sum arguments, the precise Lean statements, the separation between the registry’s challenge and implemented solution, and the historical verification evidence for the pinned source revision. The contribution is an auditable exposition of an existing formalization of classical mathematics, with no claim of new mathematics or formalization priority.
Provenance statement
Formalizations
Tools used
- OpenAI
- ChatGPTVersion GPT 6.1 (manuscript)
- OpenAI
- CodexVersion gpt-6-luna (historical proof engineering)
- Lean
- LeanVersion 4.35.0-rc2 (registered artifact)
References
- de Moura, Leonardo; Ullrich, Sebastian. The Lean 4 Theorem Prover and Programming Language. Automated Deduction–CADE 28, vol. 12699, pp. 625–635. 2021. \urlhttps://doi.org/10.1007/978-3-030-79876-5_37DOI
- Palomar Registry. Mechanical Verification of the Shapley Characterization. 2026. Verified September 24, 2026. \urlhttps://github.com/PalomarRegistry/PalomarSubmission/actions/runs/36005001365
- Palomar Registry. Shapley Value Axiomatic Characterization. 2026. Registered September 25, 2026. \urlhttps://palomar-registry.org/entry?id=PALOMAR-2026-09-25-000008&version=1
- Ramos, Arthur Freitas. Shapley Value Axiomatic Characterization in Lean 4. 2026. Commit \nolinkurlee15891fecdf294363791c61a5ec018109fe423a. \urlhttps://github.com/Arthur742Ramos/shapley-value-lean/tree/ee15891fecdf294363791c61a5ec018109fe423a
- Rota, Gian-Carlo. On the Foundations of Combinatorial Theory I. Theory of Mobius Functions. Zeitschrift fur Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol. 2, pp. 340–368. 1964. \urlhttps://doi.org/10.1007/BF00531932DOI
- The Shapley Value: Essays in Honor of Lloyd S. Shapley. Cambridge University Press. 1988. \urlhttps://doi.org/10.1017/CBO9780511528446DOI
- Shapley, Lloyd S. A Value for n-Person Games. Contributions to the Theory of Games II, vol. 28. 1953. \urlhttps://doi.org/10.1515/9781400881970-018DOI
- The mathlib Community. The Lean Mathematical Library. Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, pp. 367–381. 2020. \urlhttps://doi.org/10.1145/3372885.3373824DOI