IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-00754466.html

Robust equilibria under non-common priors

Author

Listed:
  • Daisuke Oyama

    (Graduate School of Economics - Hitotsubashi University - Hitotsubashi University)

  • Olivier Tercieux

    (PSE - Paris-Jourdan Sciences Economiques - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - INRA - Institut National de la Recherche Agronomique - EHESS - École des hautes études en sciences sociales - ENPC - École nationale des ponts et chaussées - CNRS - Centre National de la Recherche Scientifique, PSE - Paris School of Economics - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École nationale des ponts et chaussées - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)

Abstract

This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogeneous priors. An equilibrium of a complete information game is robust to incomplete information under non-common priors if for every incomplete information game where each player's prior assigns high probability on the event that the players know at arbitrarily high order that the payoffs are given by the complete information game, there exists a Bayesian Nash equilibrium that generates behavior close to the equilibrium in consideration. It is shown that for generic games, an equilibrium is robust under non-common priors if and only if it is the unique rationalizable action profile. Set-valued concepts are also introduced, and for generic games, a smallest robust set is shown to exist and coincide with the set of a posteriori equilibria.

Suggested Citation

  • Daisuke Oyama & Olivier Tercieux, 2010. "Robust equilibria under non-common priors," Post-Print halshs-00754466, HAL.
    • Handle: RePEc:hal:journl:halshs-00754466
    DOI: 10.1016/j.jet.2009.10.009
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    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. Lu, Shih En, 2017. "Coordination-free equilibria in cheap talk games," Journal of Economic Theory, Elsevier, vol. 168(C), pages 177-208.
    2. Fabien Gensbittel & Marcin Peski & Jérôme Renault, 2021. "Value-Based Distance Between Information Structures," Working Papers hal-01869139, HAL.
    3. Ronald Stauber, 2014. "A framework for robustness to ambiguity of higher-order beliefs," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(3), pages 525-550, August.
    4. repec:upd:utmpwp:006 is not listed on IDEAS
    5. Chen, Yi-Chun & Takahashi, Satoru & Xiong, Siyang, 2014. "The robust selection of rationalizability," Journal of Economic Theory, Elsevier, vol. 151(C), pages 448-475.
    6. Oyama, Daisuke & Tercieux, Olivier, 2012. "On the strategic impact of an event under non-common priors," Games and Economic Behavior, Elsevier, vol. 74(1), pages 321-331.
    7. Atsushi Kajii & Stephen Morris, 2020. "Correction to: Notes on “refinements and higher order beliefs”," The Japanese Economic Review, Springer, vol. 71(2), pages 353-354, April.
    8. Chen, Yi-Chun & Takahashi, Satoru & Xiong, Siyang, 2022. "Robust refinement of rationalizability with arbitrary payoff uncertainty," Games and Economic Behavior, Elsevier, vol. 136(C), pages 485-504.
    9. Daisuke Oyama & Satoru Takahashi, 2020. "Generalized Belief Operator and Robustness in Binary‐Action Supermodular Games," Econometrica, Econometric Society, vol. 88(2), pages 693-726, March.
    10. Oyama, Daisuke & Takahashi, Satoru, 2015. "Contagion and uninvadability in local interaction games: The bilingual game and general supermodular games," Journal of Economic Theory, Elsevier, vol. 157(C), pages 100-127.
    11. Kunimoto, Takashi, 2020. "Robust virtual implementation with almost complete information," Mathematical Social Sciences, Elsevier, vol. 108(C), pages 62-73.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    JEL classification:

    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games

    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:hal:journl:halshs-00754466. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.