Search results
Results from the WOW.Com Content Network
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.
Kuhn has written extensively on the prisoner's dilemma. In his article 'Pure and Utilitarian Prisoner's dilemmas', [3] he distinguishes between a 'pure' prisoner's dilemma and an impure prisoner's dilemma. A "pure dilemma" is defined when no mixed strategies improve outcomes over mutual cooperation; it's an "impure dilemma" when such strategies ...
The first mathematical discussion of the prisoner's dilemma appeared, and an experiment was undertaken by mathematicians Merrill M. Flood and Melvin Dresher, as part of the RAND Corporation's investigations into game theory. RAND pursued the studies because of possible applications to global nuclear strategy. [15]
Melvin Dresher (born Dreszer; March 13, 1911 – June 4, 1992) was a Polish-born American mathematician, notable for developing, alongside Merrill Flood, the game theoretical model of cooperation and conflict known as the Prisoner's dilemma while at RAND in 1950 (Albert W. Tucker gave the game its prison-sentence interpretation, and thus the name by which it is known today).
"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".
The payoffs in the Prisoner's Dilemma game are fixed, but in real life defectors are often punished by cooperators. Where punishment is costly there is a second-order dilemma amongst cooperators between those who pay the cost of enforcement and those who do not. [37]
Tit-for-tat has been very successfully used as a strategy for the iterated prisoner's dilemma. The strategy was first introduced by Anatol Rapoport in Robert Axelrod's two tournaments, [3] held around 1980. Notably, it was (on both occasions) both the simplest strategy and the most successful in direct competition.
Merrill Meeks Flood (1908 – 1991 [1]) was an American mathematician, notable for developing, with Melvin Dresher, the basis of the game theoretical Prisoner's dilemma model of cooperation and conflict while being at RAND in 1950 (Albert W. Tucker gave the game its prison-sentence interpretation, and thus the name by which it is known today).