Abstract
In a game with transferable utility (TU-game) each coalition (subset of players) is characterized by its worth, i.e., a real number representing the payoff or utility that the coalition can achieve if it forms. It is assumed that this payoff can be freely distributed among the members of the coalition in any way desired.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
See Sect. 11.1 for definitions.
References
Bondareva, O. N. (1962). Theory of the core in the n-person game. Vestnik Leningradskii Universitet, 13, 141–142 (in Russian).
Gillies, D. B. (1953). Some theorems on n-person games. Ph.D. Thesis, Princeton University Press, Princeton, New Jersey.
Lucas, W. F. (1969). The proof that a game may not have a solution. Transactions of the American Mathematical Society, 136, 219–229.
Morris, P. (1994). Introduction to game theory. New York: Springer.
Owen, G. (1995). Game theory (3rd ed.). San Diego: Academic.
Shapley, L. S. (1967). On balanced sets and cores. Naval Research Logistics Quarterly, 14, 453–460.
von Neumann, J., & Morgenstern, O. (1944/1947). Theory of games and economic behavior. Princeton: Princeton University Press.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Peters, H. (2015). TU-Games: Domination, Stable Sets, and the Core. In: Game Theory. Springer Texts in Business and Economics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46950-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-662-46950-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46949-1
Online ISBN: 978-3-662-46950-7
eBook Packages: Business and EconomicsEconomics and Finance (R0)