Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
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