Computing Simply Stable Equilibria
For each two-player game, a linear-programming algorithm finds a component of the Nash equilibria and a subset of its perfect equilibria that are simply stable in the sense that there are nearby equilibria for each nearby game that perturbs one strategy's probability or payoff more than others. Copyright 1992 by The Econometric Society.
If you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 60 (1992)
Issue (Month): 5 (September)
|Contact details of provider:|| Phone: 1 212 998 3820|
Fax: 1 212 995 4487
Web page: http://www.econometricsociety.org/
More information through EDIRC
|Order Information:|| Web: https://www.econometricsociety.org/publications/econometrica/access/ordering-back-issues Email: |