Values on regular games under Kirchhoff's laws
In cooperative game theory, the Shapley value is a central notion defining a rational way to share the total worth of a game among players. In this paper, we address a general framework, namely regular set systems, where the set of feasible coalitions forms a poset where all maximal chains have the same length. We first show that previous definitions and axiomatizations of the Shaphey value proposed by Faigle and Kern and Bilbao and Edelman still work. our main contribution is then to propose a new axiomatization avoiding the hierarchical strength axiom of Faigle and Kern, and considering a new way to define the symmetry among players. Borrowing ideas from electric networks theory, we show that our symmetry axiom and the classical efficiency axiom correspond actually to the two Kirchhoff's laws in the resistor circuit associated to the Hasse diagram of feasible coalitions. We finally work out a weak form of the monotonicity axiom which is satisfied by the proposed value.
|Date of creation:||Dec 2006|
|Contact details of provider:|| Postal: 106 - 112 boulevard de l'Hôpital, 75647 Paris cedex 13|
Phone: 01 44 07 81 00
Fax: 01 44 07 81 09
Web page: http://mse.univ-paris1.fr/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Pradeep Dubey & Abraham Neyman & Robert James Weber, 1981.
"Value Theory Without Efficiency,"
Mathematics of Operations Research,
INFORMS, vol. 6(1), pages 122-128, February.
- Pradeep Dubey & Abraham Neyman & Robert J. Weber, 1979. "Value Theory without Efficiency," Cowles Foundation Discussion Papers 513, Cowles Foundation for Research in Economics, Yale University.
- Hwang, Yan-An & Liao, Yu-Hsien, 2008. "Potential approach and characterizations of a Shapley value in multi-choice games," Mathematical Social Sciences, Elsevier, vol. 56(3), pages 321-335, November.
- Michel Grabisch & Fabien Lange, 2007. "Games on lattices, multichoice games and the shapley value: a new approach," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(1), pages 153-167, February.
- Michel Grabisch & Fabien Lange, 2007. "Games on lattices, multichoice games and the Shapley value: a new approach," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00178916, HAL.
- Robert J. Weber, 1977. "Probabilistic Values for Games," Cowles Foundation Discussion Papers 471R, Cowles Foundation for Research in Economics, Yale University.
- Pradeep Dubey & Robert J. Weber, 1977. "Probabilistic Values for Games," Cowles Foundation Discussion Papers 471, Cowles Foundation for Research in Economics, Yale University.
- Faigle, U & Kern, W, 1992. "The Shapley Value for Cooperative Games under Precedence Constraints," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(3), pages 249-266.
- Calvo, Emilio & Lasaga, Javier & van den Nouweland, Anne, 1999. "Values of games with probabilistic graphs," Mathematical Social Sciences, Elsevier, vol. 37(1), pages 79-95, January. Full references (including those not matched with items on IDEAS)