Mertens-stable equilibrium

Mertens stability is a solution concept used to predict the outcome of a non-cooperative game. A tentative definition of stability was proposed by Elon Kohlberg and Jean-François Mertens^[1] for games with finite numbers of players and strategies. Later, Mertens^[2] proposed a stronger definition that was elaborated further by Srihari Govindan and Mertens.^[3] This solution concept is now called Mertens stability, or just stability.

Like other refinements of Nash equilibrium^[4] used in game theory stability selects subsets of the set of Nash equilibria that have desirable properties. Stability invokes stronger criteria than other refinements, and thereby ensures that more desirable properties are satisfied.

Desirable Properties of a Refinement

Refinements have often been motivated by arguments for admissibility, backward induction, and forward induction. In a two-player game, an admissible decision rule for a player is one that does not use any strategy that is weakly dominated by another (see Strategic dominance). Backward induction posits that a player's optimal action in any event anticipates that his and others' subsequent actions are optimal. The refinement called subgame perfect equilibrium implements a weak version of backward induction, and increasingly stronger versions are sequential equilibrium, perfect equilibrium, quasi-perfect equilibrium, and proper equilibrium. Forward induction posits that a player's optimal action in any event presumes the optimality of others' past actions whenever that is consistent with his observations. Forward induction^[5] is satisfied by a sequential equilibrium for which a player's belief at an information set assigns probability only to others' optimal strategies that enable that information to be reached.

Kohlberg and Mertens emphasized further that a solution concept should satisfy the invariance principle that it not depend on which among the many equivalent representations of the strategic situation as an extensive-form game is used. Thus it should depend only on the reduced normal-form game obtained after elimination of pure strategies that are redundant because their payoffs for all players can be replicated by a mixture of other pure strategies. Mertens^[6]^[7] emphasized also the importance of the small worlds principle that a solution concept should depend only on the ordinal properties of players' preferences, and should not depend on whether the game includes extraneous players whose actions have no effect on the original players' feasible strategies and payoffs.

Kohlberg and Mertens demonstrated via examples that not all of these properties can be obtained from a solution concept that selects single Nash equilibria. Therefore, they proposed that a solution concept should select closed connected subsets of the set of Nash equilibria.^[8]

Properties of Stable Sets

Admissibility and Perfection: Each equilibrium in a stable set is perfect, and therefore admissible.
Backward Induction and Forward Induction: A stable set includes a proper equilibrium of the normal form of the game that induces a quasi-perfect and therefore a sequential equilibrium in every extensive-form game with perfect recall that has the same normal form. A subset of a stable set survives iterative elimination of weakly dominated strategies and strategies that are inferior replies at every equilibrium in the set.
Invariance and Small Worlds: The stable sets of a game are the projections of the stable sets of any larger game in which it is embedded while preserving the original players' feasible strategies and payoffs.^[9]
Decomposition and Player Splitting. The stable sets of the product of two independent games are the products of their stable sets. Stable sets are not affected by splitting a player into agents such that no path through the game tree includes actions of two agents.

For two-player games with perfect recall and generic payoffs, stability is equivalent to just three of these properties: a stable set uses only undominated strategies, includes a quasi-perfect equilibrium, and is immune to embedding in a larger game.^[10]

Definition of a Stable Set

A stable set is defined mathematically by essentiality of the projection map from a closed connected neighborhood in the graph of the Nash equilibria over the space of perturbed games obtained by perturbing players' strategies toward completely mixed strategies. This definition requires more than every nearby game having a nearby equilibrium. Essentiality requires further that no deformation of the projection maps to the boundary, which ensures that perturbations of the fixed point problem defining Nash equilibria have nearby solutions. This is apparently necessary to obtain all the desirable properties listed above.

Mertens provided several formal definitions depending on the coefficient module used for homology or cohomology.

A formal definition requires some notation. For a given game $G$ let $\Sigma$ be product of the simplices of the players' of mixed strategies. For each $0<\delta \leq 1$ , let $P_{\delta }=\{\,\epsilon \tau \mid 0\leq \epsilon \leq \delta ,\tau \in \Sigma \,\}$ and let $\partial P_{\delta }$ be its topological boundary. For $\eta \in P_{{1}}$ let ${\bar {\eta }}$ be the minimum probability of any pure strategy. For any $\eta \in P_{1}$ define the perturbed game $G(\eta )$ as the game where the strategy set of each player $n$ is the same as in $G$ , but where the payoff from a strategy profile $\tau$ is the payoff in $G$ from the profile $\sigma =(1-{\bar {\eta }})\tau +\eta$ . Say that $\sigma$ is a perturbed equilibrium of $G(\eta )$ if $\tau$ is an equilibrium of $G(\eta )$ . Let ${\mathcal {E}}$ be the graph of the perturbed equilibrium correspondence over $P_{1}$ , viz., the graph ${\mathcal {E}}$ is the set of those pairs $(\eta ,\sigma )\in P_{1}\times \Sigma$ such that $\sigma$ is a perturbed equilibrium of $G(\eta )$ . For $(\eta ,\sigma )\in {\mathcal {E}}$ , $\tau (\eta ,\sigma )\equiv (\sigma -\eta )/(1-{\bar {\eta }})$ is the corresponding equilibrium of $G(\eta )$ . Denote by $p$ the natural projection map from ${\mathcal {E}}$ to $P_{1}$ . For $E\subseteq {\mathcal {E}}$ , let $E_{0}=\{\,(0,\sigma )\in E\,\}$ , and for $0<\delta \leq 1$ let $(E_{\delta },\partial E_{\delta })=p^{{-1}}(P_{\delta },\partial P_{\delta })\cap E$ . Finally, ${\check {H}}$ refers to Čech cohomology with integer coefficients.

The following is a version of the most inclusive of Mertens' definitions, called *-stability.

Definition of a *-stable set: $S\subseteq \Sigma$ is a *-stable set if for some closed subset $E$ of ${\mathcal {E}}$ with $E_{0}=\{\,0\,\}\times S$ it has the following two properties:

Connectedness: For every neighborhood $V$ of $E_{0}$ in $E$ , the set $V\setminus \partial E_{1}$ has a connected component whose closure is a neighborhood of $E_{0}$ in $E$ .
Cohomological Essentiality: $p^{*}:{\check {H}}^{*}(P_{\delta },\partial P_{\delta })\to {\check {H}}^{*}(E_{\delta },\partial E_{\delta })$ is nonzero for some $\delta >0$ .

If essentiality in cohomomology or homology is relaxed to homotopy then a weaker definition is obtained, which differs chiefly in a weaker form of the decomposition property.^[11]

References

↑ Kohlberg, Elon, and Jean-François Mertens (1986). "On the Strategic Stability of Equilibria" (PDF). Econometrica. 54 (5): 1003–1037. JSTOR 1912320. doi:10.2307/1912320.
↑ Mertens, Jean-François, 1989, and 1991. "Stable Equilibria - A Reformulation," Mathematics of Operations Research, 14: 575-625 and 16: 694-753.
↑ Govindan, Srihari, and Jean-François Mertens, 2004. "An Equivalent Definition of Stable Equilibria," International Journal of Game Theory, 32(3): 339-357.
↑ Govindan, Srihari & Robert Wilson, 2008. "Refinements of Nash Equilibrium," The New Palgrave Dictionary of Economics, 2nd edition.
↑ Govindan, Srihari, and Robert Wilson, 2009. "On Forward Induction," Econometrica, 77(1): 1-28.
↑ Mertens, Jean-François, 2003. "Ordinality in Non Cooperative Games," International Journal of Game Theory, 32: 387–430.
↑ Mertens, Jean-François, 1992. "The Small Worlds Axiom for Stable Equilibria," Games and Economic Behavior, 4: 553-564.
↑ The requirement that the set is connected excludes the trivial refinement that selects all equilibria. If only a single (possibly unconnected) subset is selected then only the trivial refinement satisfies the conditions invoked by H. Norde, J. Potters, H. Reijnierse, and D. Vermeulen (1996): ``Equilibrium Selection and Consistency, Games and Economic Behavior, 12: 219-225.
↑ See Appendix D of Govindan, Srihari, and Robert Wilson, 2012. "Axiomatic Theory of Equilibrium Selection for Generic Two-Player Games," Econometrica, 70.
↑ Govindan, Srihari, and Robert Wilson, 2012. "Axiomatic Theory of Equilibrium Selection for Generic Two-Player Games," Econometrica, 70.
↑ Srihari Govindan and Robert Wilson, 2008. "Metastable Equilibria," Mathematics of Operations Research, 33: 787-820.

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 game Strictly determined game Potential game
Games	Prisoner's dilemma Optional 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 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 Prisoners and hats puzzle Trust game Princess and Monster game 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 Antoine Augustin Cournot 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 Axelrod 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. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.