We apply Mertens' dedinition of stability for a game in strategic form to a game in extensive form with perfect recall. We prove that if payoffs are generic then the outcomes of stable sets of equilibria defined via homological essentiality by Mertens coincide with those defined via homotopic essentiality. This implies that for such games various definitions of stability in terms of perturbations of players' strategies as in Mertens or best-reply correspondences as in Govindan and Wilson yield the same outcomes. A corollary yields a computational test that usually suffices to identify the stable outcomes of such a game.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Stanford University, Graduate School of Business in its series Research Papers with number
1933r.
For technical questions regarding this item, or to correct its listing, contact: ().
Related research
Keywords:
Find related papers by JEL classification: C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Govindan, Srihari & Wilson, Robert B., 2007.
"Metastable Equilibria,"
Research Papers
1934r, Stanford University, Graduate School of Business.
[Downloadable!]
Other versions: