Jump to content

Aggregative game: Difference between revisions

From Wikipedia, the free encyclopedia
format
(No difference)

Revision as of 17:55, 11 October 2013


In game theory, an aggregative game is a game in which every player’s payoff is a function of the player’s own strategy and the aggregate of all players’ strategies. The concept was first proposed by Nobel laureate Reinhard Selten in 1970 who considered the case where the aggregate is the sum of the players' strategies.

Aggregative games is a very important class of games from an applied perspective. Some of the best known examples of aggregative games are the Cournot model, models of Bertrand competition with differentiated products, public goods games with private provision, contests, strategic models of general equilibrium, as well as many games in which externalities are dependent on the aggregate actions of all players (such as pollution, or R&D games).

Definition

Consider a standard non-cooperative game with n players, where is the strategy set of player i, is the joint strategy set, and is the payoff function of player i. The game is then called an aggregative game if for each player i there exists a function such that for all :

In words, payoff functions in aggregative games depend on players' own strategies and the aggregate . As an example, consider the Cournot model where firm i has payoff/profit function (here and are, respectively, the inverse demand function and the cost function of firm i). This is an aggregative game since where .

Generalizations

A number of generalizations of the standard definition of an aggregative game have appeared in the literature. A game is generalized aggregative (Cornes and Hartley (2012)) if there exists an additively separable function (i.e., if there exist increasing functions such that ) such that for for each player i there exists a function such that for all . Obviously, any aggregative game is generalized aggregative as seen by taking . A more general definition still is that of Quasi-Aggregative Games where agents' payoff functions are allowed to depend on different functions of opponents' strategies (Jensen (2010)).

Properties

  • Generalized aggregative games (hence aggregative games) admit backward reply correspondences and in fact, is the most general class to do so (Cornes and Hartley (2012)). Backward reply correspondences, as well as the closely related share correspondences, are powerful analytical tools in game theory. For example, backward reply correspondences were used to give the first general proof of the existence of a Nash equilibrium in the Cournot model without assuming quasiconcavity of firms' profit functions (Novshek (1985)). Backward reply correspondences also play a crucial role for comparative statics analysis (see below).
  • Quasi-aggregative games (hence generalized aggregative games, hence aggregative games) are best-response potential games if best-response correspondences are either increasing or decreasing (Dubey at al (2006), Jensen (2010)). Precisely as games with strategic complementarities, such games therefore have a pure strategy Nash equilibrium regardless of whether payoff functions are quasiconcave and/or strategy sets are convex. The existence proof in Novshek (1985) is a special case of such more general existence results.
  • Aggregative games have strong comparative statics properties. Under very general conditions one can predict how a change in exogenous parameters will affect the Nash equilibria (see e.g. Corchon (1994) and Acemoglu and Jensen (2013)).

References

  • Template:Cite article
  • Template:Cite article
  • Template:Cite article
  • Template:Cite article
  • Template:Cite article
  • Template:Cite article
  • Selten, R. (1970). Preispolitik der Mehrproduktenunternehmung in der Statischen Theorie (First ed.). Springer Verlag, Berlin. {{cite book}}: Invalid |ref=harv (help)