The novelty of our model is to combine models of collective action on networks with models of social learning. Agents are connected according to an undirected graph, the social network, and have the choice between two actions: either to adopt a new behavior or technology or stay with the default...

Observational learning is typically examined when agents have precise information about their position in the sequence of play. We present a model in which agents are uncertain about their positions. Agents sample the decisions of past individuals and receive a private signal about the state of...

I present a model of observational learning with payoff interdependence. Agents, ordered in a sequence, receive private signals about an uncertain state of the world and sample previous actions. Unlike in standard models of observational learning, an agent's payoff depends both on the state and...

This paper studies fictitious play in networks of noncooperative two-person games. We show that continuous-time fictitious play converges to the set of Nash equilibria if the overall n-person game is zero-sum. Moreover, the rate of convergence is 1/T, regardless of the size of the network. In...

We report the findings of experiments designed to study how people learn in network games. Network games offer new opportunities to identify learning rules, since on networks (compared to, e.g., random matching) more rules differ in terms of their information requirements. Our experimental...

Social media are becoming increasingly important in our society and change the way people communicate, how they acquire information, and how they form beliefs. Experts are concerned that the rise of social media may make interaction and information exchange among like-minded individuals more...

We develop a model of information exchange through communication and investigate its implications for information aggregation in large societies. An \textit{underlying state} determines payoffs from different actions. Agents decide which others to form a costly \textit{communication link} with,...

This paper studies fictitious play in networks of noncooperative two-player games. We show that continuous-time fictitious play converges to Nash equilibrium provided that the overall game is zero-sum. Moreover, the rate of convergence is 1/T , regardless of the size of the network. In contrast,...

This paper studies fictitious play in networks of noncooperative two-person games. We show that continuous-time fictitious play converges to the set of Nash equilibria if the overall n-person game is zero-sum. Moreover, the rate of convergence is 1/T, regardless of the size of the network. In...

We develop a dynamic framework of strategic information transmission through cheap talk in a social network. Privately informed agents have different preferences about the action to be implemented by each agent and repeatedly communicate with their neighbors in the network. We first characterize...