Distributed Algorithms for Aggregative Games on Graphs

A distributed algorithm for average aggregative games with coupling constraints

We consider the framework of average aggregative games, where the cost function of each agent depends on his own strategy and on the average population strategy. We focus on the case in which the agents are coupled not only via their cost functions, but also via affine constraints on the average of the agents’ strategies. We propose a distributed algorithm that achieves an almost Nash equilibri...

Stochastic games for distributed players on graphs

Aggregative Games with Entry1

Aggregative games are used to model strategic interaction in many …elds of economics, including industrial organization, political economy, international trade, and public …nance. In such games, each player’s payo¤ depends on his/her own actions and an aggregate of all player’s actions. Examples in industrial organization are the Cournot oligopoly model, logit and CES di¤erentiated products Ber...

Local Aggregative Games

Aggregative games provide a rich abstraction to model strategic multi-agent interactions. We introduce local aggregative games, where the payoff of each player is a function of its own action and the aggregate behavior of its neighbors in a connected digraph. We show the existence of pure strategy -Nash equilibrium in such games when the payoff functions are convex or sub-modular. We prove an i...

Aggregative Public Good Games

We exploit the aggregative structure of the public good model to provide a simple analysis of the voluntary contribution game. In contrast to the best response function approach, ours avoids the proliferation of dimensions as the number of players is increased, and can readily analyse games involving many heterogeneous players. We demonstrate the approach at work on the standard pure public eco...