IDEAS home Printed from https://ideas.repec.org/p/vie/viennp/vie1005.html

Long-run equilibria, dominated strategies, and local interactions

Author

Abstract

The present note revisits a result by Kim and Wong (2010) showing that any strict Nash equilibrium of a coordination game can be supported as a long run equilibrium by properly adding dominated strategies. We show that in the circular city model of local interactions the selection of 1/2-dominant strategies remains when adding strictly dominated strategies if interaction is "decentral". Conversely, if the local interaction structure is "central" by adding properly suited dominated strategies any equilibrium strategy of the original game can be supported as long run equilibrium. Classification- JEL: C72, D83

Suggested Citation

  • Simon Weidenholzer, 2010. "Long-run equilibria, dominated strategies, and local interactions," Vienna Economics Papers vie1005, University of Vienna, Department of Economics.
    • Handle: RePEc:vie:viennp:vie1005
    as

    Download full text from publisher

    File URL: https://papersecon.univie.ac.at/RePEc/vie/viennp/vie1005.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. Ge Jiang & Simon Weidenholzer, 2017. "Local interactions under switching costs," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 64(3), pages 571-588, October.
    2. Ennio Bilancini & Leonardo Boncinelli, 2020. "The evolution of conventions under condition-dependent mistakes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 69(2), pages 497-521, March.
    3. Sawa, Ryoji, 2021. "A stochastic stability analysis with observation errors in normal form games," Games and Economic Behavior, Elsevier, vol. 129(C), pages 570-589.
    4. Daniel Christopher Opolot, 2022. "On the relationship between p-dominance and stochastic stability in network games," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(2), pages 307-351, June.

    More about this item

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search; Learning; Information and Knowledge; Communication; Belief; Unawareness

    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:vie:viennp:vie1005. 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: Paper Administrator (email available below). General contact details of provider: https://econ.univie.ac.at/ .

    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.