SearcharxivSearch

arXiv subjects

Srihari Govindan

Publications and source records attributed to Srihari Govindan.

4 recordsLinked to original sources

Axiomatic Equilibrium Selection: The Case of Generic Extensive Form Games

A solution concept that is a refinement of Nash equilibria selects for each finite game a nonempty collection of closed and connected subsets of Nash equilibria as solutions. We impose three axioms for such solution concepts. The axiom of backward induction requires each solution to contain a quasi-perfect equilibrium. Two invariance axioms posit that solutions of a game are the same as those of a game obtained by the addition of strategically irrelevant strategies and players. Stability satisfies these axioms; and any solution concept that satisfies them must, for generic extensive-form games, select from among its stable outcomes. A strengthening of the two invariance axioms provides an analogous axiomatization of components of equilibria with a nonzero index.

econ.TH

O'Neill's Theorem for Games

We present an analog of O'Neill's Theorem (Theorem 5.2 in [17]) for finite games, which reveals some of the structure of equilibria under payoff perturbations in finite games.

cs.GT

A Finite Characterization of Perfect Equilibria

Govindan and Klumpp [7] provided a characterization of perfect equilibria using Lexicographic Probability Systems (LPSs). Their characterization was essentially finite in that they showed that there exists a finite bound on the number of levels in the LPS, but they did not compute it explicitly. In this note, we draw on two recent developments in Real Algebraic Geometry to obtain a formula for this bound.

econ.TH

On Sustainable Equilibria

Following the ideas laid out in Myerson (1996), Hofbauer (2000) defined a Nash equilibrium of a finite game as sustainable if it can be made the unique Nash equilibrium of a game obtained by deleting/adding a subset of the strategies that are inferior replies to it. This paper proves two results about sustainable equilibria. The first concerns the Hofbauer-Myerson conjecture about the relationship between the sustainability of an equilibrium and its index: for a generic class of games, an equilibrium is sustainable iff its index is $+1$. Von Schemde and von Stengel (2008) proved this conjecture for bimatrix games; we show that the conjecture is true for all finite games. More precisely, we prove that an isolated equilibrium has index +1 if and only if it can be made unique in a larger game obtained by adding finitely many strategies that are inferior replies to that equilibrium. Our second result gives an axiomatic extension of sustainability to all games and shows that only the Nash components with positive index can be sustainable.

econ.TH