We study aggregative games in which players’ strategy sets areconvex intervals of the real line and (not necessarily differentiable)payoffs depend only on a player’s own strategy and the sum of allplayers’ strategies. We give sufficient conditions on each player’s payofffunction to...

Player i's payoff in a noncooperative game is generally expressed as a function of thevector of strategies of all players. However, in some games - 'simply reducible games' - thepayoff of player i is a function of two arguments - the strategy chosen by i, and the sum ofthe strategies of all...