Psychology Wiki

Cooperative game

34,201pages on
this wiki
Add New Page
Add New Page Talk0

Assessment | Biopsychology | Comparative | Cognitive | Developmental | Language | Individual differences | Personality | Philosophy | Social |
Methods | Statistics | Clinical | Educational | Industrial | Professional items | World psychology |

Statistics: Scientific method · Research methods · Experimental design · Undergraduate statistics courses · Statistical tests · Game theory · Decision theory

A cooperative game is a game where groups of players ("coalitions") may enforce cooperative behaviour, hence the game is a competition between coalitions of players, rather than between individual players.

Recreational games are rarely cooperative, because they usually lack mechanisms by which coalitions may enforce coordinated behaviour on the members of the coalition. Such mechanisms, however, are abundant in real life situations - from law to legal contract.

Mathematical treatmentEdit

A cooperative game is given by specifying a value for every (nonempty) coalition. Mathematically speaking, the game is a function
 \nu \; : \; 2^N \; \to \Re
from the set of coalitions to a set of payments (it is called characteristic function). The function describes how much collective payoff a set of players can gain by forming a coalition. The players are assumed to choose which coalitions to form, according to their estimate of the way the payment will be divided among coalition members. It is assumed that the empty coalition gains nil.

Axioms for cooperative game characterization Edit

Super Additivity
If A and B are any two coalitions then their joint value is no less than the sum of their values:  \nu (A \cup B) \; \ge \; \nu (A) \; + \; \nu (B) .
Larger coalitions gain more:  A \subseteq B \Rightarrow \nu (A) \le \nu (B) .

Simple gamesEdit

A simple game is a special kind of cooperative game, where the payoffs are either 1 or 0. I.e. coalitions are either "winning" or "losing".

  • A simple game is called proper, if  \nu (A) \; = \; 1 \; - \; \nu (N \setminus A) . That is, a coalition is winning if and only if its complement (opposition) is losing.
  • A veto player in a simple game is a player who is included in all winning coalitions. That is, all coalitions not containing the veto player are losing.

Relation with non-cooperative theoryEdit

Let G be a strategic (non-cooperative) game. Then, assuming that coalitions have the ability to enforce coordinated behaviour, there are several cooperative games associated with G. These games are often referred to as representations of G.

  • The α-effective game associates with each coalition the sum of gains its members can 'guarantee' by joining forces. By 'guaranteeing', it is meant that the value is the max-min, e.g. the maximal value of the minimum taken over the opposition's strategies.
  • The β-effective game associates with each coalition the sum of gains its members can 'strategically guarantee' by joining forces. By 'strategically guaranteeing', it is meant that the value is the min-max, e.g. the minimal value of the maximum taken over the opposition's strategies.

Solution concepts for cooperative theoryEdit

A cooperative game describes payoffs given for coalitions. Players will only join a coalition if they expect to gain from it. So, in order to find what coalitions will actually be created, one needs to estimate both the relative power of different coalitions, as well as the strength of the different players within each coalition.

The core Edit

Main article: Core (economics)

The core of a game is a set of vectors allocating payoffs to players, which preserve the following conditions:

  • Efficiency: it is assumed that the players form the grand coalition (a coalition containing all players), and so the sum of individual payoffs should equal the value of the grand coalition.
  • Strategic stability or balance: no coalition can earn more by defecting from the grand coalition. E.g. no coalition has a value greater than the sum of its members' payoffs.

Note that the core of a game may be empty.

Shapley's value Edit

Main article: Shapley value

The KernelEdit

Is a vector allocating payoffs to players which is:

  • Efficient
  • Personally reasonable

Some examples of recreational cooperative gamesEdit

One example is "Stand Up", where a number of individuals sit down, link arms (all facing away from each other) and attempt to stand up. This objective becomes more difficult as the number of players increases.

Another is the counting game, where the players, as a group, attempt to count to 20 with no two participants saying the same number twice. In a cooperative version of volleyball, the emphasis is on keeping the ball in the air for as long as possible.

Role-playing games are the most common form of recreational cooperative game, where coalition forming (and sometimes coalition disintegration) are an intrinsic part of the game. In such games, the players, who act through persons called "characters", usually strive toward intertwined goals. However, each character has his or her own ambitions, and ultimately, individual goals. Hence conflict between groups of characters often occurs in these games.

Cooperative board games are rare, the most famous example perhaps being Reiner Knizia's game Lord of the Rings. Another example is the Days Of Wonder game Shadows Over Camelot. However, many card games and board games can exhibit cooperative behaviour, usually where a group of weak players join forces to halt the progress of a leading player. An interesting example is Diplomacy, a board game in which the forming and breaking of coalitions is the main strategic aspect of play.


  • Osborne, M.J. and Rubinstein, A. (1994) A Course in Game Theory, MIT Press (see Chapters 13,14,15)
  • Luce, R.D. and Raiffa, H. (1957) Games and Decisions: An Introduction and Critical Survey, Wiley & Sons. (see Chapter 8).

es:Juego cooperativo

uk:Гра кооперативна ru:Кооперативная игра (математика)

Also on Fandom

Random Wiki