Share This
summary started by
spencermountain for the Game theory Base
There is no user-contributed description yet.
Add More Topics
Save this view to a base, or just for yourself.
29 Game theory game topics matching:
Filter this Collection
Rock, Paper, Scissors
Rock-paper-scissors is a hand game played by two people. The game is also known as roshambo, or another ordering of the three items (with "stone" sometimes substituting for "rock").
The game is often used as a choosing method in a way similar to...
Strategies per player:
- 3
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 0
Battle of the sexes
In game theory, battle of the sexes (BoS), also called Bach or Stravinsky, is a two-player coordination game. Imagine a couple that agreed to meet this evening, but cannot recall if they will be attending the opera or a football match (and the fact...
Strategies per player:
- 2
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 2
Fair division
Fair division, also known as the cake-cutting problem, is the problem of dividing a resource in such a way that all recipients believe that they have received a fair amount. The problem is easier when recipients have different measures of value of...
Centipede game
In game theory, the centipede game, first introduced by Rosenthal (1981), is an extensive form game in which two players take turns choosing either to take a slightly larger share of a slowly increasing pot, or to pass the pot to the other player....
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 1
Chicken
The game of chicken, also known as the hawk-dove game, is an influential model of conflict for two players in game theory. The principle of the game is that while each player prefers not to yield to the other, the worst possible outcome occurs when...
Strategies per player:
- 2
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 2
Coordination game
In game theory, coordination games are a class of games with multiple pure strategy Nash equilibria in which players choose the same or corresponding strategies. Coordination games are a formalization of the idea of a coordination problem, which is...
Number of pure strategy Nash equilibria:
- 2
Cournot competition
Cournot competition is an economic model used to describe an industry structure in which companies compete on the amount of output they will produce, which they decide on independently of each other and at the same time. It is named after Antoine...
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 1
Deadlock
A deadlock is a situation in which two or more competing actions are each waiting for the other to finish, and thus neither ever does.
In an operating system, a deadlock is a situation which occurs when a process enters a waiting state because a...
Strategies per player:
- 2
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 1
Dictator game
The dictator game is a game in experimental economics, similar to the ultimatum game. Experimental results offer evidence against the rationally self-interested individual (sometimes called the homo economicus) concept of economic behavior, though...
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 1
Diner's dilemma
In game theory, the Unscrupulous diner's dilemma (or just Diner's dilemma) is an n-player prisoner's dilemma. The situation imagined is that several individuals go out to eat, and prior to ordering they agree to split the check equally between all...
Strategies per player:
- 2
Number of pure strategy Nash equilibria:
- 1
Dollar auction
The dollar auction is a non-zero sum sequential game designed by economist Martin Shubik to illustrate a paradox brought about by traditional rational choice theory in which players with perfect information in the game are compelled to make an...
Strategies per player:
- 2
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 0
El Farol bar problem
The El Farol bar problem is a problem in game theory. Based on a bar in Santa Fe, New Mexico, it was created in 1994 by W. Brian Arthur.
The problem is as follows: There is a particular, finite population of people. Every Thursday night, all of...
Strategies per player:
- 2
Example of a game without a value
In game theory, and in particular the study of zero-sum continuous games, it is commonly assumed that a game has a minimax value. This is the expected value to one of the players when both play a perfect strategy (which is to choose from a...
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 0
Guess 2/3 of the average
In game theory, Guess 2/3 of the average is a game where several people guess what 2/3 of the average of their guesses will be, and where the numbers are restricted to the real numbers between 0 and 100, inclusive. The winner is the one closest to...
Number of pure strategy Nash equilibria:
- 1
Kuhn poker
Kuhn poker is a simplified form of poker developed by Dr. Harold W. Kuhn. It is a zero sum two player game. The deck includes only three playing cards, for example a King, Queen, and Jack. One card is dealt to each player, then the first player must...
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 0
Matching pennies
Matching pennies is the name for a simple example game used in game theory. It is the two strategy equivalent of Rock, Paper, Scissors. Matching pennies is used primarily to illustrate the concept of mixed strategies and a mixed strategy Nash...
Strategies per player:
- 2
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 0
Minority game
Minority Game is a game proposed by Yi-Cheng Zhang and Damien Challet from the University of Fribourg. It is inspired by the El Farol bar problem, which is a simple model that shows how (selfish) players cooperate with each other in the absence of...
Strategies per player:
- 2
Nash bargaining game
The Nash bargaining game is a simple two-player game used to model bargaining interactions. In the Nash Bargaining Game two players demand a portion of some good (usually some amount of money). If the two proposals sum to no more than the total good...
Number of players:
- 2
Peace war game
An iterated game originally played in academic groups and by computer simulation for years to study possible strategies of cooperation and aggression. As peace makers became richer over time it became clear that making war had greater costs than...
Number of pure strategy Nash equilibria:
- 2
Pirate game
The pirate game is a simple mathematical game. It illustrates how, if assumptions conforming to a homo economicus model of human behaviour hold, outcomes may be surprising. It is a multi-player version of the ultimatum game.
There are 5 rational...
Prisoner's dilemma
The prisoner's dilemma is a canonical example of a game analyzed in game theory that shows why two individuals might not cooperate, even if it appears that it is in their best interest to do so. It was originally framed by Merrill Flood and Melvin...
Strategies per player:
- 2
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 1
Screening game
A screening game is a two-player principal–agent type game used in economic and game theoretical modeling. Principal–agent problems are situations where there are two players whose interests are not necessarily at ends, but where complete honesty is...
Stag hunt
In game theory, the stag hunt is a game which describes a conflict between safety and social cooperation. Other names for it or its variants include "assurance game", "coordination game", and "trust dilemma". Jean-Jacques Rousseau described a...
Strategies per player:
- 2
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 2
Traveler's dilemma
In game theory, the traveler's dilemma (sometimes abbreviated TD) is a type of non-zero-sum game in which two players attempt to maximize their own payoff, without any concern for the other player's payoff.
The game was formulated in 1994 by Kaushik...
Strategies per player:
- 1
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 1
Trust game
Trust game in experimental economics extend the dictator game one step by having the reward that the dictator can (unilaterally) split between herself and a partner partially decided by an initial gift from that partner.
The initial move is from...
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 1
Volunteer's dilemma
The volunteer's dilemma game models a situation in which each of N players faces the decision of either making a small sacrifice from which all will benefit, or freeriding.
One example is a scenario in which the electricity has gone out for an...
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 2
War of attrition
In game theory, the war of attrition is a model of aggression in which two contestants compete for a resource of value V by persisting while constantly accumulating costs over the time t that the contest lasts. The model was originally formulated by...
Strategies per player:
- 2
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 0
Ultimatum game
The ultimatum game is a game often played in economic experiments in which two players interact to decide how to divide a sum of money that is given to them. The first player proposes how to divide the sum between the two players, and the second...
Number of players:
- 2
Princess and monster game
In game theory, the princess and monster game is a pursuit-evasion game played by two players in a region. The game was devised by Rufus Isaacs and published in his book Differential Games (1965) as follows. "The monster searches for the princess,...
Number of players:
- 2
Number of pure strategy Nash equilibria:
- 0
