# List of games in game theory

*34,190*pages on

this wiki

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

Game theory studies strategic interaction between individuals in situations called games. Classes of these games have been given names. This is a list of the most commonly studied games.

## Contents

[show]## Explanation of featuresEdit

Games can have several features, a few of the most common are listed here.

**Number of Players**: Each person who makes a choice in a game or who receives a payoff from the outcome of those choices is a player.**Strategies per player**: In a game each player chooses from a set of possible actions, known as strategies. If the number is the same for all players, it is listed here.**Number of pure strategy Nash equilibria**: A Nash equilibrium is a set of strategies which represents mutual best responses to the other strategies. In other words, if every player is playing their part of a Nash equilibrium, no player has an incentive to unilaterally change her strategy. Considering only situations where players play a single strategy without randomizing (a pure strategy) a game can have any number of Nash equilibria.**Sequential game**: A game is sequential if one player performs her actions after another, otherwise the game is a simultaneous move game.**Perfect information**: A game has perfect information if it is a sequential game and every player knows the strategies chosen by the players who preceded them.**Constant sum**: A game is constant sum if the sum of the payoffs to every player are the same for every set of strategies. In these games one player gains if and only if another player loses.

## List of gamesEdit

Game | Players | Strategies per player | Number of pure strategy Nash equilibria | Sequential | Perfect information | Constant sum (e.g. Zero sum) |
---|---|---|---|---|---|---|

Battle of the sexes | 2 | 2 | 2 | No | No | No |

Centipede game | 2 | variable | 1 | Yes | Yes | No |

Chicken (aka hawk-dove) | 2 | 2 | 2 | No | No | No |

Coordination game | N
| variable | >2 | No | No | No |

Cournot game | 2 | infinite^{[1]}
| 1 | No | No | Yes |

Deadlock | 2 | 2 | 1 | No | No | No |

Dictator game | 2 | infinite^{[1]}
| 1 | N/A^{[2]}
| N/A^{[2]}
| Yes |

Diner's dilemma | N
| 2 | 1 | No | No | No |

Dollar auction | 2 | 2 | 0 | Yes | Yes | No |

El Farol bar | N
| 2 | variable | No | No | No |

Guess 2/3 of the average | N
| infinite | 1 | No | No | Yes |

Kuhn poker | 2 | 12 & 4 | 0 | Yes | No | Yes |

Matching pennies | 2 | 2 | 0 | No | No | Yes |

Minority Game | N
| 2 | variable | No | No | No |

Nash bargaining game | 2 | infinite^{[1]}
| infinite^{[1]}
| No | No | Yes |

Pirate game | N
| infinite^{[1]}
| infinite^{[1]}
| Yes | Yes | Yes |

Prisoner's dilemma | 2 | 2 | 1 | No | No | No |

Rock, Paper, Scissors | 2 | 3 | 0 | No | No | Yes |

Signaling game | N
| variable | variable | Yes | No | No |

Stag hunt | 2 | 2 | 2 | No | No | No |

Trust game | 2 | infinite | 1 | Yes | Yes | No |

Ultimatum game | 2 | infinite^{[1]}
| infinite^{[1]}
| Yes | Yes | Yes |

## NotesEdit

- ↑
^{1.0}^{1.1}^{1.2}^{1.3}^{1.4}^{1.5}^{1.6}^{1.7}There may be finite depending on how goods are divisible. - ↑
^{2.0}^{2.1}Since the dictator game only involves one player actually choosing a strategy (the other does nothing), it cannot really be classified as sequential or perfect information.

## ReferencesEdit

- Arthur, W. Brian “Inductive Reasoning and Bounded Rationality”,
*American Economic Review (Papers and Proceedings)*, 84,406-411, 1994. - Bolton, Katok, Zwick 1998, "Dictator game giving: Rules of fairness versus acts of kindness"
*International Journal of Game Theory*, Volume 27, Number 2 - Gibbons, Robert (1992) A Primer in Game Theory, Harvester Wheatsheaf
- Glance, Huberman. (1994) "The dynamics of social dilemmas."
*Scientific American.* - H. W. Kuhn, Simplified Two-Person Poker; in H. W. Kuhn and A. W. Tucker (editors), Contributions to the Theory of Games, volume 1, pages 97-103, Princeton University Press, 1950.
- Martin J. Osborne & Ariel Rubinstein: A Course in Game Theory (1994).
- McKelvey, R. and T. Palfrey (1992) "An experimental study of the centipede game,"
*Econometrica*60(4), 803-836. - Nash, John (1950) "The Bargaining Problem" Econometrica 18: 155-162.
- Ochs, J. and A.E. Roth (1989) "An Experimental Study of Sequential Bargaining" American Economic Review 79: 355-384.
- Rapoport, A. (1966) The game of chicken, American Behavioral Scientist 10: 10-14.
- Rasmussen, Eric: Games and Information, 2004
- Shor, Mikhael Battle of the sexes. GameTheory.net.
- Shor, Mikhael Deadlock. GameTheory.net.
- Shor, Mikhael Matching Pennies. GameTheory.net.
- Shor, Mikhael Prisoner's Dilemma. GameTheory.net.
- Shubik, Martin "The Dollar Auction Game: A Paradox in Noncooperative Behavior and Escalation," The
*Journal of Conflict Resolution*, 15, 1, 1971, 109-111. - Sinervo, B., and Lively, C. (1996). "The Rock-Paper-Scissors Game and the evolution of alternative male strategies". Nature Vol.380, pp.240-243
- Skyrms, Brian. (2003) The stag hunt and Evolution of Social Structure Cambridge: Cambridge University Press.

- he:רשימת משחקים בתורת המשחקים

This page uses Creative Commons Licensed content from Wikipedia (view authors). |