Sequential equilibrium

Sequential Equilibrium
A solution concept in game theory
Relationships
Subset of	Subgame perfect equilibrium, perfect Bayesian equilibrium
Superset of	extensive-form trembling hand perfect equilibrium, Quasi-perfect equilibrium
Significance
Proposed by	David M. Kreps and Robert Wilson
Used for	Extensive form games

Sequential equilibrium is a refinement of Nash Equilibrium for extensive form games due to David M. Kreps and Robert Wilson. A sequential equilibrium specifies not only a strategy for each of the players but also a belief for each of the players. A belief gives, for each information set of the game belonging to the player, a probability distribution on the nodes in the information set. A profile of strategies and beliefs is called an assessment for the game. Informally speaking, an assessment is a perfect Bayesian equilibrium if its strategies are sensible given its beliefs and its beliefs are confirmed on the outcome path given by its strategies. The definition of sequential equilibrium further requires that there be arbitrarily small perturbations of beliefs and associated strategies with the same property.

Consistent assessments

The formal definition of a strategy being sensible given a belief is straightforward; the strategy should simply maximize expected payoff in every information set. It is also straightforward to define what a sensible belief should be for those information sets that are reached with positive probability given the strategies; the beliefs should be the conditional probability distribution on the nodes of the information set, given that it is reached. This entails the application of Bayes' rule.

It is far from straightforward to define what a sensible belief should be for those information sets that are reached with probability zero, given the strategies. Indeed, this is the main conceptual contribution of Kreps and Wilson. Their consistency requirement is the following: The assessment should be a limit point of a sequence of totally mixed strategy profiles and associated sensible beliefs, in the above straightforward sense.

Relationship to other equilibrium refinements

Sequential equilibrium is a further refinement of subgame perfect equilibrium and even perfect Bayesian equilibrium. It is itself refined by extensive-form trembling hand perfect equilibrium and proper equilibrium. Strategies of sequential equilibria (or even extensive-form trembling hand perfect equilibria) are not necessarily admissible. A refinement of sequential equilibrium that guarantees admissibility is quasi-perfect equilibrium.

References

David M. Kreps and Robert Wilson. "Sequential Equilibria", Econometrica 50:863-894, 1982.

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 equilibrium Perfect Bayesian equilibrium Trembling hand Proper equilibrium Epsilon-equilibrium Correlated equilibrium Sequential equilibrium Quasi-perfect equilibrium Evolutionarily stable strategy Risk dominance Core Shapley value Pareto efficiency Gibbs equilibrium 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 Screening 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 Potential 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 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 Topological game Tragedy of the commons Tyranny of small decisions

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