|
Maxn Algorithm
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.) Analysis ''n''-player games can not be solved using minimax Minimax (sometimes Minmax, MM or saddle point) is a decision rule used in artificia ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Game Theory
Game theory is the study of mathematical models of strategic interactions. It has applications in many fields of social science, and is used extensively in economics, logic, systems science and computer science. Initially, game theory addressed two-person zero-sum games, in which a participant's gains or losses are exactly balanced by the losses and gains of the other participant. In the 1950s, it was extended to the study of non zero-sum games, and was eventually applied to a wide range of Human behavior, behavioral relations. It is now an umbrella term for the science of rational Decision-making, decision making in humans, animals, and computers. Modern game theory began with the idea of mixed-strategy equilibria in two-person zero-sum games 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 mathematical economics. His paper was f ... [...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 ** Checkers ** 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 model, mathematical representation in game theory and economic theory of a situation that involves two competition, competing entities, where the result is an advantage for one side and an equivalent loss for the o ... References {{Refli ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Game Theorist
A game is a structured type of play usually undertaken for entertainment or fun, and sometimes used as an educational tool. Many games are also considered to be work (such as professional players of spectator sports or video games) or art (such as games involving an artistic layout such as mahjong, solitaire, or some video games). Games have a wide range of occasions, reflecting both the generality of its concept and the variety of its play. Games are sometimes played purely for enjoyment, sometimes for achievement or reward as well. They can be played alone, in teams, or online; by amateurs or by professionals. The players may have an audience of non-players, such as when people are entertained by watching a chess championship. On the other hand, players in a game may constitute their own audience as they take their turn to play. Often, part of the entertainment for children playing a game is deciding who is part of their audience and who participates as a player. A toy and a ... [...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 agent (economics), 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 st ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prisoner's Dilemma
The prisoner's dilemma is a game theory thought experiment involving two rational agents, each of whom can either cooperate for mutual benefit or betray their partner ("defect") for individual gain. The dilemma arises from the fact that while defecting is rational for each agent, cooperation yields a higher payoff for each. The puzzle was designed by Merrill Flood and Melvin Dresher in 1950 during their work at the RAND Corporation. They invited economist Armen Alchian and mathematician John Williams to play a hundred rounds of the game, observing that Alchian and Williams often chose to cooperate. When asked about the results, John_Forbes_Nash_Jr., John Nash remarked that rational behavior in the Prisoner's dilemma#The_iterated_prisoner's_dilemma, iterated version of the game can differ from that in a single-round version. This insight anticipated a Folk_theorem_(game_theory), key result in game theory: cooperation can emerge in repeated interactions, even in situations where it i ... [...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] |
Minimax Theorem
In the mathematical area of game theory and of convex optimization, a minimax theorem is a theorem that claims that : \max_ \min_ f(x,y) = \min_ \max_f(x,y) under certain conditions on the sets X and Y and on the function f. It is always true that the left-hand side is at most the right-hand side ( max–min inequality) but equality only holds under certain conditions identified by minimax theorems. The first theorem in this sense is von Neumann's minimax theorem about two-player zero-sum games published in 1928, which is considered the starting point of game theory. Von Neumann is quoted as saying "''As far as I can see, there could be no theory of games ... without that theorem ... I thought there was nothing worth publishing until the Minimax Theorem was proved''". Since then, several generalizations and alternative versions of von Neumann's original theorem have appeared in the literature. Bilinear functions and zero-sum games Von Neumann's original theorem was motivated by ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
