 Axiomatic Equilibrium Selection for Generic Two-Player GamesSrihari Govindan and Robert Wilson () Research Papers from Stanford University, Graduate School of Business Abstract: We apply three axioms adapted from decision theory to refinements of the Nash equilibria of games with perfect recall that select connected closed sub- sets called solutions. No player uses a weakly dominated strategy in an equilibrium in a solution. Each solution contains a quasi-perfect equilibrium and thus a sequential equilibrium in strategies that provide conditionally admissible optimal continuations from information sets. A refinement is immune to embedding a game in a larger game with additional players provided the original players' strategies and payoffs are preserved, i.e. solutions of a game are the same as those induced by the solutions of any larger game in which it is embedded. For games with two players and generic payoffs, we prove that these axioms characterize each solution as an essential component of equilibria in undominated strategies, and thus a stable set as defined by Mertens (1989). JEL-codes: C72 (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ecl:stabus:2021 Access Statistics for this paper More papers in Research Papers from Stanford University, Graduate School of Business Contact information at EDIRC. |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.