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 present a sequential decomposition algorithm to compute graphon mean-field equilibrium (GMFE) of dynamic graphon mean-field games (GMFGs). We consider a large population of players sequentially making strategic decisions where the actions of each player affect their neighbors...

In part I of this paper, we proposed a Mixed-Integer Linear Program (MILP) to analyze imperfect competition of oligopoly producers in two-stage zonal power markets. In part II of this paper, we propose a solution algorithm which decomposes the proposed MILP model into several subproblems and...

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