We impose three conditions on refinements of the Nash equilibria of finite games with perfect recall that select closed connected subsets, called solutions. A. Each equilibrium in a solution uses undominated strategies; B. Each solution contains a quasi-perfect equilibrium; C. The solutions of a...

Three axioms from decision theory select sets of Nash equilibria of signaling games in extensive form with generic payoffs. The axioms require undominated strategies (admissibility), inclusion of a sequential equilibrium (backward induction), and dependence only on the game's normal form even...

A refinement of the set of Nash equilibria that satisfies two assumptions is shown to select a subset that is stable in the sense defined by Kohlberg and Mertens. One assumption requires that a selected set is invariant to adjoining redundant strategies and the other is a strong version of...