34 Pages Posted: 11 Jul 2013 Last revised: 23 Jun 2016
Date Written: November 5, 2014
We study a dynamic game in which short-run players repeatedly play a symmetric, strictly supermodular game whose payoff depends on a fixed unknown state of nature. Each short-run player inherits the beliefs of his immediate predecessor in addition to observing the actions of the players in his social neighborhood in the previous stage. Due to the strategic complementary between their actions, players have the incentive to coordinate with, and learn from others. We show that in any Markov Perfect Bayesian Equilibrium of the game, players eventually reach consensus in their actions. They also asymptotically receive similar payoffs in spite of initial differences in their access to information. We further show that, if the players' payoffs can be represented by a quadratic function, then the private observations are optimally aggregated in the limit for generic specifications of the game. Therefore, players asymptotically coordinate on choosing the best action given the aggregate information available throughout the network. We provide extensions of our results to the case of changing networks and endogenous private signals.
Keywords: Consensus, information aggregation, supermodular games, social networks
JEL Classification: C73, D83, D85
Suggested Citation: Suggested Citation
Molavi, Pooya and Eksin, Ceyhun and Ribeiro, Alejandro and Jadbabaie, Ali, Learning to Coordinate in Social Networks (November 5, 2014). Available at SSRN: https://ssrn.com/abstract=2292124 or http://dx.doi.org/10.2139/ssrn.2292124