Abstract
Assume that we have a finite set of players I. Any subset K of this set (K ⊂ I) will be called a coalition. We shall also consider coalitions consisting of one player and even a void coalition with no players at all. In what follows we shall not distinguish between the coalition involving only one player i (singleton {1}) and the player i and we shall denote this coalition by the symbol i. A void coalition will be denoted by the symbol Ø (empty set).
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer-Verlag, New York Inc.
About this chapter
Cite this chapter
Vorob’ev, N.N. (1977). Cooperative games. In: Game Theory. Applications of Mathematics, vol 7. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-6341-8_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-6341-8_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6343-2
Online ISBN: 978-1-4612-6341-8
eBook Packages: Springer Book Archive