TOPICS
Search

Coordination Game


A coordination game is a game in which the players can obtain mutual gains by choosing compatible strategies. In a two-player coordination game with two strategies per player, the payoffs can be written

 [(A,a) (C,c); (B,b) (D,d)],

where A>B, D>C, a>c, and d>b. The two diagonal outcomes are then pure-strategy Nash equilibria.

When the players rank the two Nash equilibria differently, the result is the battle of the sexes. When both rank one Nash equilibrium higher but strategic uncertainty can trap them at the other, the game exhibits a coordination failure.

A simple example models two drivers approaching one another. Each chooses the left or right side of the road relative to the driver's own direction of travel. Choosing the same convention avoids a collision, whereas choosing different conventions causes one (Ross 2023). Assigning a payoff of 1 to safe passage and -1 to a collision gives the payoff matrix

 [(1,1) (-1,-1); (-1,-1) (1,1)],

with rows and columns ordered left, right. The two pure-strategy Nash equilibria are (left, left) and (right, right). This is distinct from the chicken game, whose strategies are to swerve or continue straight rather than to choose a common side of the road.


See also

Battle of the Sexes, Chicken Game, Nash Equilibrium, Payoff Matrix, Strategy

Portions of this entry contributed by Charlie Brummitt

Explore with Wolfram|Alpha

References

Cooper, R.; DeJong, D. V.; Forsythe, R.; and Ross, T. W. "Selection Criteria in Coordination Games: Some Experimental Results." Amer. Econ. Rev. 80, 218-233, 1990.Ross, D. "Game Theory." Stanford Encyclopedia of Philosophy. Sep. 3, 2023. https://plato.stanford.edu/entries/game-theory/.

Cite this as:

Weisstein, Eric W., with contributions by Charlie Brummitt. "Coordination Game." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CoordinationGame.html

Subject classifications