Generalized Belief Operator and Robustness in Binary‐Action Supermodular Games

Daisuke Oyama and Satoru Takahashi

Econometrica, 2020, vol. 88, issue 2, 693-726

Abstract: This paper studies the robustness of an equilibrium to incomplete information in binary‐action supermodular games. Using a generalized version of belief operator, we explore the restrictions that prior beliefs impose on higher order beliefs. In particular, we obtain a nontrivial lower bound on the probability of a common belief event, uniform over type spaces, when the underlying game has a monotone potential. Conversely, when the game has no monotone potential, we construct a type space with an arbitrarily high probability event in which players never have common belief about that event. As an implication of these results, we show for generic binary‐action supermodular games that an action profile is robust to incomplete information if and only if it is a monotone potential maximizer. Our study offers new methodology and insight to the analysis of global game equilibrium selection.

Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
https://doi.org/10.3982/ECTA17237

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:wly:emetrp:v:88:y:2020:i:2:p:693-726

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 W. Imbens

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