Mathematics – Probability
Scientific paper
2008-01-22
Annals of Applied Probability 2008, Vol. 18, No. 1, 259-287
Mathematics
Probability
Published in at http://dx.doi.org/10.1214/07-AAP455 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Inst
Scientific paper
10.1214/07-AAP455
An evolutionarily stable strategy (ESS) is an equilibrium strategy that is immune to invasions by rare alternative (``mutant'') strategies. Unlike Nash equilibria, ESS do not always exist in finite games. In this paper we address the question of what happens when the size of the game increases: does an ESS exist for ``almost every large'' game? Letting the entries in the $n\times n$ game matrix be independently randomly chosen according to a distribution $F$, we study the number of ESS with support of size $2.$ In particular, we show that, as $n\to \infty$, the probability of having such an ESS: (i) converges to 1 for distributions $F$ with ``exponential and faster decreasing tails'' (e.g., uniform, normal, exponential); and (ii) converges to $1-1/\sqrt{e}$ for distributions $F$ with ``slower than exponential decreasing tails'' (e.g., lognormal, Pareto, Cauchy). Our results also imply that the expected number of vertices of the convex hull of $n$ random points in the plane converges to infinity for the distributions in (i), and to 4 for the distributions in (ii).
Hart Sergiu
Rinott Yosef
Weiss Benjamin
No associations
LandOfFree
Evolutionarily stable strategies of random games, and the vertices of random polygons does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Evolutionarily stable strategies of random games, and the vertices of random polygons, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Evolutionarily stable strategies of random games, and the vertices of random polygons will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-95377