Computing Simply Stable Equilibria

Robert Wilson ()

Econometrica, 1992, vol. 60, issue 5, 1039-70

Abstract: 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.

Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://links.jstor.org/sici?sici=0012-9682%2819920 ... O%3B2-J&origin=repec full text (application/pdf)
Access to full text is restricted to JSTOR subscribers. See http://www.jstor.org for details.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ecm:emetrp:v:60:y:1992:i:5:p:1039-70

Ordering information: This journal article can be ordered from
https://www.economet ... ordering-back-issues

Access Statistics for this article

Econometrica is currently edited by Guido Imbens

More articles in Econometrica from Econometric Society Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().