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

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

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

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