IDEAS home Printed from https://ideas.repec.org/p/ecl/stabus/1934r.html

Metastable Equilibria

Author

Listed:
  • Govindan, Srihari

    (U of Iowa)

  • Wilson, Robert B.

    (Stanford U)

Abstract

We define a refinement of Nash equilibria called metastability. This refinement supposes that the given game might be embedded within any global game that leaves its local bestreply correspondence unaffected. A selected set of equilibria is metastable if it is robust against perturbations of every such global game; viz., every sufficiently small perturbation of the best-reply correspondence of each global game has an equilibrium that projects arbitrarily near the selected set. Metastability satisfies the standard decisiontheoretic axioms obtained by Mertens' (1989) refinement (the strongest proposed refinement), and it satisfies the projection property in Mertens' small-worlds axiom: a metastable set of a global game projects to a metastable set of a local game. But the converse is slightly weaker than Mertens' decomposition property: a metastable set of a local game contains a metastable set that is the projection of a metastable set of a global game. This is inevitable given our demonstration that metastability is equivalent to a strong form of homotopic essentiality. Mertens' definition invokes homological essentiality whereas we derive homotopic essentiality from primitives (robustness for every embedding). We argue that this weak version of decomposition has a natural gametheoretic interpretation.

Suggested Citation

  • Govindan, Srihari & Wilson, Robert B., 2007. "Metastable Equilibria," Research Papers 1934r, Stanford University, Graduate School of Business.
    • Handle: RePEc:ecl:stabus:1934r
    as

    Download full text from publisher

    File URL: http://gsbapps.stanford.edu/researchpapers/library/RP1934R.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Govindan, Srihari & Wilson, Robert B., 2007. "Stable Outcomes of Generic Games in Extensive Form," Research Papers 1933r, Stanford University, Graduate School of Business.
    2. Srihari Govindan & Robert Wilson, 2012. "Axiomatic Equilibrium Selection for Generic Two‐Player Games," Econometrica, Econometric Society, vol. 80(4), pages 1639-1699, July.
    3. Srihari Govindan & Robert Wilson, 2008. "Axiomatic Theory of Equilibrium Selection in Signalling Games with Generic Payoffs," Levine's Working Paper Archive 122247000000002381, David K. Levine.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ecl:stabus:1934r. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/gsstaus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.