Aggregative Games

An abstract notion of aggregative games is introduced and a pure strategy Nash equilibrium shown to exist for such games. Convergence of best-reply improvement dynamics is also studied. All assumptions are straight-forward to check in concrete applications. The paper’s results generalize the main results of Dubey et al. (2006) and Kukushkin (2005). Likewise, the aggregator concept of Alos-Ferrer and Ania (2005) and Schipper (2005) is a special case. The relationship with both is studied in detail. A number of examples illustrate the paper’s main findings. Among these a model of open source development may be of some independent interest.