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

amp;#65279;An N-player game can be approximated by adding a coordinator who interacts bilaterally with each player. The coordinator proposes strategies to the players, and his payoff is maximized when each player's optimal reply agrees with his proposal. When the feasible set of proposals is finite,...

Using network control structures this paper introduces network communication games as a generalization of vertex games and edge games corresponding to communication situations and studies their decomposition into unanimity games. We obtain a relation between the dividends of the network...

We study the Shapley wage function, a wage scheme in which a worker's pay depends both on the number of hours worked and on the output of the firm. We then provide a way to measure the distance of an arbitrary wage scheme to this function in limited datasets. In particular, for a fixed...

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