if the network is 2-connected: that is, if no player can prevent the flow of information to another. In contrast, the …

convergence is 1/T, regardless of the size of the network. In contrast, arbitrary n-person zero-sum games with bilinear payoff … requires a condition on bilateral payoffs or, alternatively, that the network is acyclic. Our results hold also for the …

I present a behavioural model of network formation with positive network externalities in which individuals have …

starting network. To study factors affecting equilibrium selection, we designed a network formation experiment with multiple …Theoretical models on network formation focus mostly on the stability and efficiency of equilibria, but they cannot … stage in which the network is disrupted. This setting allows us to analyze the interplay between the need for farsightedness …

Three kinds of activities happen in a network: agents link or unlink; agents act; agents observe and learn. The … existing literature on network formation, on network games and on monitoring and learning in networks studies each of these in … are linked and (perhaps) from a public signal. We define a repeated network game and an equilibrium of this game. An …

We develop a model of social preferences for network games and study its predictions in a local public goods game with … equilibrium set. How easily the requirements for preference compatibility are met crucially depends on a property of the network … centralized networks. All predictions are confirmed in an experiment. …

In this paper, we show that a concept of aggregation can hold in large network games with linear best replies. Breaking … compute all Nash equilibria for the special network structure of cograph. A key finding is that a stable Nash equilibrium of … the large network game can be decomposed into a collection of Nash equilibria of subnetwork games. Thereby, we establish a …

This paper proposes new centrality measures to characterise the 'key class', when agents in a network are sorted into … role-equivalent classes, such that its removal results in an optimal change in the network activity. The notion of role … theoretical applicability. Players in the network engage in a non-cooperative game with local payoff complementarities. We …

We consider network games in which players simultaneously form partnerships and choose actions. Players are …. We find that, despite the symmetry and simplicity of the setting, quite irregular network structures can arise in …

We address the problem of a planner looking for the efficient network when agents play a network game with local … complementarities and links are costly. We show that for general network cost functions, efficient networks belong to the class of … Nested-Split Graphs. Next, we refine our results and find that, depending on the specification of the network cost function …