We consider situations in which individuals would like to choose an action which is close to that of others, as well as close to a state of nature, with the ideal proximity to the state varying across agents. Before this coordination game is played, a cheap-talk communication stage is offered to...

A fundamental question in social sciences is how trust emerges. We provide an answer which relies on the formation of social and economic relationships. We argue that behind trust lies the fact that individuals invest in connections taking into account the potential externalities networks...

We investigate the scope for cooperation within a community engaged in repeated reciprocal interactions. Players seek the help of others and approach them sequentially according to some fixed order, that is, a ranking profile. We study the ranking profiles that are most effective in sustaining...

The paper discusses community enforcement in infinitely repeated, two-action games with local interaction and uncertain monitoring. Each player interacts with and observes only a fixed set of opponents, of whom he is privately informed. The main result shows that when beliefs about the...

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

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

This paper studies a game of attack and interception in a network, where a single attacker chooses a target and a path, and each node chooses a level of protection. We show that the Nash equilibrium of the game exists and is unique. We characterize equilibrium attack paths and attack...

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 considers a population of agents that are engaged in a listening network. The agents wish to match their actions to the true value of some uncertain (exogenous) parameter and to the actions of the other agents. Each agent begins with some initial information about the parameter and,...

Since the seminal contribution of Jackson & Wolinsky 1996 [A Strategic Model of Social and Economic Networks, JET 71, 44-74] it has been widely acknowledged that the formation of social networks exhibits a general conflict between individual strategic behavior and collective outcome. What has...