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.
|Date of creation:||Aug 2006|
|Date of revision:|
|Contact details of provider:|| Postal: Edgbaston, Birmingham, B15 2TT|
Web page: http://www.economics.bham.ac.uk
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:bir:birmec:06-10. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Colin Rowat)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.