n-player game

In <a href="/facts/Game_theory/zkEIj1ya">game theory</a>, an n-player game is a game which is well defined for any number of players. This is usually used in contrast to standard <a href="/facts/2-player_game/6H7azUX8">2-player games</a> that are only specified for two players. In defining n-player games, <a href="/facts/Game_theorist/zkEIj1ya">game theorists</a> usually provide a definition that allow for any (finite) number of players. The limiting case of 
 
 
 
 n
 →
 ∞
 
 
 {\displaystyle n\to \infty }
 
 is the subject of <a href="/facts/Mean_field_game_theory/hW6MBuBH">mean field game theory</a>.
Changing games from 2-player games to n-player games entails some concerns. For instance, the <a href="/facts/Prisoner%2527s_dilemma/44kueSBQ">Prisoner's dilemma</a> is a 2-player game. One might define an n-player Prisoner's Dilemma where a single defection results everyone else getting the sucker's payoff. Alternatively, it might take certain amount of defection before the cooperators receive the sucker's payoff. (One example of an n-player Prisoner's Dilemma is the <a href="/facts/Diner%2527s_dilemma/b560N4Fg">Diner's dilemma</a>.)

n-player game open-in-new

n-player game