The evolutionary stability of perfectly competitive behavior
In a (generalized) symmetric aggregative game, payoffs depend only on individual strategy and an aggregate of all strategies. Players behaving as if they were negligible would optimize taking the aggregate as given. We provide evolutionary and dynamic foundations for such behavior when the game satisfies supermodularity conditions. The results obtained are also useful to characterize evolutionarily stable strategies in a finite population. Copyright Springer-Verlag Berlin/Heidelberg 2005
If you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 26 (2005)
Issue (Month): 3 (October)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/199/PS2|
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:26:y:2005:i:3:p:497-516. 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: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.