This paper analyzes the private provision of public goods where consumers interact within a fixed network structure and may benefit only from their direct neighbors' provisions. We present a proof for existence and uniqueness of a Nash equilibrium with general best-reply functions. Our...

In this paper, we show that a concept of aggregation can hold in network games. Breaking up large networks into smaller pieces, which can be replaced by representative players, leads to a coarse-grained description of strategic interactions. This method of summarizing complex strategic...

In this paper, we show that a concept of aggregation can hold in large network games with linear best replies. Breaking up large networks into smaller subnetworks, which can be replaced by representative players, leads to a coarse-grained description of strategic interactions. This method of...

This paper proposes new centrality measures to characterise the ‘key class’, whose removal results in maximal reduction in the network activity, when agents in a network are sorted into role-equivalent classes. The notion of role-equivalence is defined through the graph-theoretical concept...

This paper investigates a model of strategic interactions in financial networks, where the decision by one agent on whether or not to default impacts the incentives of other agents to escape default. Agents' payoffs are determined by the clearing mechanism introduced in the seminal contribution...

This paper investigates a model of strategic interactions in financial networks, where the decision by one agent on whether or not to default impacts the incentives of other agents to escape default. Agents' payoffs are determined by the clearing mechanism introduced in the seminal contribution...

This paper analyses the private provision of public goods where agents interact within a fixed network structure and may benefit only from their direct neighbours' provisions. We survey the literature and then generalise the public goods in networks model of Bramoullé and Kranton (2007) to...

In this paper, we develop a new game theoretic network centrality measure based on the Shapley value. To do so, we consider a coalitional game, where the worth of each coalition is the total play in the game introduced in Ballester et al. (2006). We first establish that the game is convex. As 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-equivalence is defined through the graph-theoretical...