Game Theory pp 116-163 | Cite as

Cooperative games

  • N. N. Vorob’ev
Part of the Applications of Mathematics book series (SMAP, volume 7)


Assume that we have a finite set of players I. Any subset K of this set (KI) 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).


Characteristic Function Reduced Form Cooperative Game Noncooperative Game Void Coalition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag, New York Inc. 1977

Authors and Affiliations

  • N. N. Vorob’ev
    • 1
  1. 1.Institute for Social Economical QuestionsAcademy of Sciences of the USSRLeningradUSSR

Personalised recommendations