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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Department of Economics, University of Birmingham in its series Discussion Papers with number
06-10.
Find related papers by JEL classification: C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
This paper has been announced in the following NEP Reports: