Optional prisoner's dilemma
The optional prisoner's dilemma (OPD) game models a situation of conflict involving two players in game theory. It can be seen as an extension of the standard prisoner's dilemma game, where players have the option to "reject the deal", that is, to abstain from playing the game.[1] This type of game can be used as a model for a number of real world situations in which agents are afforded the third option of abstaining from a game interaction such as an election. [2]
Payoff matrix
The structure of the optional prisoner's dilemma can be generalized from the standard prisoner's dilemma game setting. In this way, suppose that the two players are represented by the colors, red and blue, and that each player chooses to "Cooperate", "Defect" or "Abstain".[3]
The payoff matrix for the game is shown below:
Cooperate | Defect | Abstain | |
---|---|---|---|
Cooperate | R, R | S, T | L, L |
Defect | T, S | P, P | L, L |
Abstain | L, L | L, L | L, L |
- If both players cooperate, they both receive the reward R for mutual cooperation.
- If both players defect, they both receive the punishment payoff P.
- If Blue defects while Red cooperates, then Blue receives the temptation payoff T, while Red receives the "sucker's" payoff, S.
- Similarly, if Blue cooperates while Red defects, then Blue receives the sucker's payoff S, while Red receives the temptation payoff T.
- If one or both players abstain, both receive the loner's payoff L.
The following condition must hold for the payoffs:
T > R > L > P > S
References
- ^ Cardinot, Marcos; Gibbons, Maud; O'Riordan, Colm; Griffith, Josephine (2016). "Simulation of an Optional Strategy in the Prisoner's Dilemma in Spatial and Non-spatial Environments". From Animals to Animats 14. Lecture Notes in Computer Science. Vol. 9825. pp. 145–156. doi:10.1007/978-3-319-43488-9_14. ISBN 978-3-319-43487-2.
- ^ Batali, John; Kitcher, Philip (1995). "Evolution of altriusm in optional and compulsory games" (PDF). Journal of Theoretical Biology. 175 (2): 161–171. doi:10.1006/jtbi.1995.0128. S2CID 35935283. Archived from the original (PDF) on 2019-02-22.
- ^ Cardinot, Marcos; O'Riordan, Colm; Griffith, Josephine (2016). "The Optional Prisoner's Dilemma in a Spatial Environment: Coevolving Game Strategy and Link Weights". ECTA. Proceedings of the 8th International Joint Conference on Computational Intelligence. Vol. 1. pp. 86–93. doi:10.5220/0006053900860093. ISBN 978-989-758-201-1.
- v
- t
- e
- Congestion game
- Cooperative game
- Determinacy
- Escalation of commitment
- Extensive-form game
- First-player and second-player win
- Game complexity
- Graphical game
- Hierarchy of beliefs
- Information set
- Normal-form game
- Preference
- Sequential game
- Simultaneous game
- Simultaneous action selection
- Solved game
- Succinct game
concepts
- Bayes correlated equilibrium
- Bayesian Nash equilibrium
- Berge equilibrium
- Core
- Correlated equilibrium
- Epsilon-equilibrium
- Evolutionarily stable strategy
- Gibbs equilibrium
- Mertens-stable equilibrium
- Markov perfect equilibrium
- Nash equilibrium
- Pareto efficiency
- Perfect Bayesian equilibrium
- Proper equilibrium
- Quantal response equilibrium
- Quasi-perfect equilibrium
- Risk dominance
- Satisfaction equilibrium
- Self-confirming equilibrium
- Sequential equilibrium
- Shapley value
- Strong Nash equilibrium
- Subgame perfection
- Trembling hand
- Backward induction
- Bid shading
- Collusion
- Forward induction
- Grim trigger
- Markov strategy
- Dominant strategies
- Pure strategy
- Mixed strategy
- Strategy-stealing argument
- Tit for tat
of games
- Go
- Chess
- Infinite chess
- Checkers
- Tic-tac-toe
- Prisoner's dilemma
- Gift-exchange game
- Optional prisoner's dilemma
- Traveler's dilemma
- Coordination game
- Chicken
- Centipede game
- Lewis signaling game
- Volunteer's dilemma
- Dollar auction
- Battle of the sexes
- Stag hunt
- Matching pennies
- Ultimatum game
- Rock paper scissors
- Pirate game
- Dictator game
- Public goods game
- Blotto game
- War of attrition
- El Farol Bar problem
- Fair division
- Fair cake-cutting
- Cournot game
- Deadlock
- Diner's dilemma
- Guess 2/3 of the average
- Kuhn poker
- Nash bargaining game
- Induction puzzles
- Trust game
- Princess and monster game
- Rendezvous problem
figures
- Albert W. Tucker
- Amos Tversky
- Antoine Augustin Cournot
- Ariel Rubinstein
- Claude Shannon
- Daniel Kahneman
- David K. Levine
- David M. Kreps
- Donald B. Gillies
- Drew Fudenberg
- Eric Maskin
- Harold W. Kuhn
- Herbert Simon
- Hervé Moulin
- John Conway
- Jean Tirole
- Jean-François Mertens
- Jennifer Tour Chayes
- John Harsanyi
- John Maynard Smith
- John Nash
- John von Neumann
- Kenneth Arrow
- Kenneth Binmore
- Leonid Hurwicz
- Lloyd Shapley
- Melvin Dresher
- Merrill M. Flood
- Olga Bondareva
- Oskar Morgenstern
- Paul Milgrom
- Peyton Young
- Reinhard Selten
- Robert Axelrod
- Robert Aumann
- Robert B. Wilson
- Roger Myerson
- Samuel Bowles
- Suzanne Scotchmer
- Thomas Schelling
- William Vickrey
- All-pay auction
- Alpha–beta pruning
- Bertrand paradox
- Bounded rationality
- Combinatorial game theory
- Confrontation analysis
- Coopetition
- Evolutionary game theory
- First-move advantage in chess
- Glossary of game theory
- List of game theorists
- List of games in game theory
- No-win situation
- Solving chess
- Topological game
- Tragedy of the commons
- Tyranny of small decisions