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
Volume (Year): 26 (2005)
Issue (Month): 3 (October)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00199/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
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 (Christopher F Baum)
If references are entirely missing, you can add them using this form.