|
N-player Game
In game theory, an ''n''-player game is a game which is well defined for any number of players. This is usually used in contrast to standard 2-player games that are only specified for two players. In defining ''n''-player games, game theorists usually provide a definition that allow for any (finite) number of players. The limiting case of n \to \infty is the subject of mean field game theory. Changing games from 2-player games to ''n''-player games entails some concerns. For instance, the Prisoner's dilemma 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 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 se ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Game Theory
Game theory is the study of mathematical models of strategic interactions among rational agents. Myerson, Roger B. (1991). ''Game Theory: Analysis of Conflict,'' Harvard University Press, p.&nbs1 Chapter-preview links, ppvii–xi It has applications in all fields of social science, as well as in logic, systems science and computer science. Originally, it addressed two-person zero-sum games, in which each participant's gains or losses are exactly balanced by those of other participants. In the 21st century, game theory applies to a wide range of behavioral relations; it is now an umbrella term for the science of logical decision making in humans, animals, as well as computers. Modern game theory began with the idea of mixed-strategy equilibria in two-person zero-sum game and its proof by John von Neumann. Von Neumann's original proof used the Brouwer fixed-point theorem on continuous mappings into compact convex sets, which became a standard method in game theory and mathem ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
2-player Game
A two-player game is a multiplayer game that is played by precisely two players. This is distinct from a solitaire game, which is played by only one player. Examples The following are some examples of two-player games. This list is not intended to be exhaustive. * Board games: ** Chess ** Draughts ** Go ** Some wargames, such as '' Hammer of the Scots'' * Card games: ** Cribbage ** Whist ** Rummy ** 66 ** Pinochle ** ''Magic: The Gathering'', a collectible card game in which players duel * Sports: ** Cue sports, a family of games that use cue sticks and billiard balls ** Many athletic games, such as tennis (singles) * Video games: **''Pong'' ** A Way Out See also * List of types of games * Zero-sum game Zero-sum game is a mathematical representation in game theory and economic theory of a situation which involves two sides, where the result is an advantage for one side and an equivalent loss for the other. In other words, player one's gain is e ... References {{Refli ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Game Theorist
Game theory is the study of mathematical models of strategic interactions among rational agents. Myerson, Roger B. (1991). ''Game Theory: Analysis of Conflict,'' Harvard University Press, p.&nbs1 Chapter-preview links, ppvii–xi It has applications in all fields of social science, as well as in logic, systems science and computer science. Originally, it addressed two-person zero-sum games, in which each participant's gains or losses are exactly balanced by those of other participants. In the 21st century, game theory applies to a wide range of behavioral relations; it is now an umbrella term for the science of logical decision making in humans, animals, as well as computers. Modern game theory began with the idea of mixed-strategy equilibria in two-person zero-sum game and its proof by John von Neumann. Von Neumann's original proof used the Brouwer fixed-point theorem on continuous mappings into compact convex sets, which became a standard method in game theory and mathema ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mean Field Game Theory
Mean-field game theory is the study of strategic decision making by small interacting agents in very large populations. It lies at the intersection of game theory with stochastic analysis and control theory. The use of the term "mean field" is inspired by mean-field theory in physics, which considers the behavior of systems of large numbers of particles where individual particles have negligible impacts upon the system. In other words, each agent acts according to his minimization or maximization problem taking into account other agents’ decisions and because their population is large we can assume the number of agents goes to infinity and a representative agent exists. In traditional game theory, the subject of study is usually a game with two players and discrete time space, and extends the results to more complex situations by induction. However, for games in continuous time with continuous states (differential games or stochastic differential games) this strategy cannot be us ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prisoner's Dilemma
The Prisoner's Dilemma is an example of a game analyzed in game theory. It is also a thought experiment that challenges two completely rational agents to a dilemma: cooperate with their partner for mutual reward, or betray their partner ("defect") for individual reward. This dilemma was originally framed by Merrill Flood and Melvin Dresher while working at RAND in 1950. Albert W. Tucker appropriated the game and formalized it by structuring the rewards in terms of prison sentences and named it "prisoner's dilemma". William Poundstone in his 1993 book ''Prisoner's Dilemma'' writes the following version:Two members of a criminal gang are arrested and imprisoned. Each prisoner is in solitary confinement with no means of speaking to or exchanging messages with the other. The police admit they don't have enough evidence to convict the pair on the principal charge. They plan to sentence both to two years in prison on a lesser charge. Simultaneously, the police offer each prison ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 people go out to eat, and before ordering, they agree to split the cost equally between them. Each diner must now choose whether to order the costly or cheap dish. It is presupposed that the costlier dish is better than the cheaper, but not by enough to warrant paying the difference when eating alone. Each diner reasons that, by ordering the costlier dish, the extra cost to their own bill will be small, and thus the better dinner is worth the money. However, all diners having reasoned thus, they each end up paying for the costlier dish, which by assumption, is worse than had they each ordered the cheaper. Formal definition and equilibrium analysis Let ''a'' represent the joy of eating the expensive meal, ''b'' the joy of eating the cheap meal, ''k'' is the cost of the expensive meal, ''l'' the cost of the cheap meal, and ''n'' the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
