Global Games With Noisy Information Sharing

Abstract
Global games form a subclass of games with incomplete information, where a set of agents decide actions against a regime with an underlying fundamental \theta representing its power. Each agent has access to an independent noisy observation of \theta. In order to capture the behavior of agents in a social network of information exchange, we assume that agents share their observation in a noisy environment prior to making their decisions. We show that global games with noisy sharing of information do not admit an intuitive type of threshold policy, which only depends on agents' belief about the underlying \theta. This is in contrast to the existing results on the threshold policy for the conventional setup of global games. Motivated by this result, we investigate the existence of equilibrium strategies in a more general collection of threshold-type policies and show that such equilibrium strategies exist and are unique if the sharing of information happens over a sufficiently noisy environment.

Citation
Mahdavifar H, Beirami A, Touri B, Shamma JS (2018) Global Games With Noisy Information Sharing. IEEE Transactions on Signal and Information Processing over Networks 4: 497–509. Available: http://dx.doi.org/10.1109/TSIPN.2017.2749969.

Acknowledgements
The authors would like to sincerely thank the associate editor and the reviewers for their careful review of this paper and for their valuable comments which have improved its quality.

Publisher
Institute of Electrical and Electronics Engineers (IEEE)

Journal
IEEE Transactions on Signal and Information Processing over Networks

DOI
10.1109/TSIPN.2017.2749969

arXiv
1510.08204

Additional Links
https://ieeexplore.ieee.org/document/8027133

Permanent link to this record