Deadlock (game theory)

An example payoff matrix for Deadlock
	C	D
c	1, 1	0, 3
d	3, 0	2, 2

In game theory, Deadlock is a game where the action that is mutually most beneficial is also dominant. This provides a contrast to the Prisoner's Dilemma where the mutually most beneficial action is dominated. This makes Deadlock of rather less interest, since there is no conflict between self-interest and mutual benefit. The game provides some interest, however, since one has some motivation to encourage one's opponent to play a dominated strategy.

General definition

	C	D
c	a, b	c, d
d	e, f	g, h

Any game that satisfies the following two conditions constitutes a Deadlock game: (1) e>g>a>c and (2) d>h>b>f. These conditions require that d and D be dominant. (d, D) be of mutual benefit, and that one prefer one's opponent play c rather than d.

Like the Prisoner's Dilemma, this game has one unique Nash equilibrium: (d, D).

References

GameTheory.net
C. Hauert: Effects of space in 2 x 2 games. Int. J. Bifurc. Chaos 12 (2002) 1531-1548.
H.-U. Stark: Dilemmas of partial cooperation. Evolution 64 (2010) 2458–2465.

Topics in game theory

Definitions	Normal-form game Extensive-form game Escalation of commitment Graphical game Cooperative game Succinct game Information set Hierarchy of beliefs Preference

Equilibrium concepts	Nash equilibrium Subgame perfection Mertens-stable equilibrium Bayesian-Nash Perfect Bayesian Trembling hand Proper equilibrium Epsilon-equilibrium Correlated equilibrium Sequential equilibrium Quasi-perfect equilibrium Evolutionarily stable strategy Risk dominance Core Shapley value Pareto efficiency Quantal response equilibrium Self-confirming equilibrium Strong Nash equilibrium Markov perfect equilibrium

Strategies	Dominant strategies Pure strategy Mixed strategy Tit for tat Grim trigger Collusion Backward induction Forward induction Markov strategy

Classes of games	Symmetric game Perfect information Simultaneous game Sequential game Repeated game Signaling game Cheap talk Zero-sum game Mechanism design Bargaining problem Stochastic game n-player game Large Poisson game Nontransitive game Global games Strictly determined game

Games	Prisoner's dilemma Traveler's dilemma Coordination game Chicken Centipede 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 games 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 Screening game Prisoners and hats puzzle Trust game Princess and monster game Monty Hall problem Rendezvous problem

Theorems	Minimax theorem Nash's theorem Purification theorem Folk theorem Revelation principle Arrow's impossibility theorem

Key figures	Albert W. Tucker Amos Tversky Ariel Rubinstein Daniel Kahneman David K. Levine David M. Kreps Donald B. Gillies Drew Fudenberg Eric Maskin Harold W. Kuhn Herbert Simon Hervé Moulin Jean Tirole Jean-François Mertens John Harsanyi John Maynard Smith John Nash John von Neumann Kenneth Arrow Kenneth Binmore Leonid Hurwicz Lloyd Shapley Melvin Dresher Merrill M. Flood Oskar Morgenstern Paul Milgrom Peyton Young Reinhard Selten Robert Aumann Robert B. Wilson Roger Myerson Samuel Bowles Thomas Schelling William Vickrey

See also	All-pay auction Alpha–beta pruning Bertrand paradox Bounded rationality Combinatorial game theory Confrontation analysis Coopetition List of game theorists List of games in game theory No-win situation Tragedy of the commons Tyranny of small decisions

This article is issued from Wikipedia - version of the Saturday, February 27, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.