Abstract
An axiomatization of a generalized Shapley value of games is proposed. The authors follow Faigle and Kern, in the sense that our basic material is the maximal chains of the underlying set system. This generalized Shapley value may have applicability to the game on set systems which satisfy the condition of a sort of normality.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Algaba, E., Bilbao, J.M., van den Brink, R., Jime’ nez-Losada, A.: Axiomatizations of the Shapley value for cooperative games on antimatroids. Math. Meth. Oper. Res. 57, 49–65 (2003)
Davey, B.A., Priestley, H.A.: Introduction to lattices and order. Cambridge University Press, Cambridge (1990)
Shapley, L.: A value for n-person games. In: Kuhn, H., Tucker, A. (eds.) Contributions to the Theory of Games, Vol. II Annals of Mathematics Studies, vol. 28, pp. 307–317. Princeton University Press, Princeton, NJ (1953)
Banzhaf III, J.F.: Weighted voting doesn’t work. A mathematical analysis. Rutgers Law Review 19, 313–345 (1965)
Faigle, U., Kern, W.: The Shapley value for cooperative games under precedence constraints. Int. J. of Game Theory 21, 249–266 (1992)
Honda, A., Grabisch, M.: Entropy of capacities on lattices. Information Sciences 176, 3472–3489 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Honda, A., Okazaki, Y. (2007). An Axiomatization of Shapley Values of Games on Set Systems. In: Torra, V., Narukawa, Y., Yoshida, Y. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2007. Lecture Notes in Computer Science(), vol 4617. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73729-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-73729-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73728-5
Online ISBN: 978-3-540-73729-2
eBook Packages: Computer ScienceComputer Science (R0)