Hostname: page-component-848d4c4894-5nwft Total loading time: 0 Render date: 2024-06-01T19:26:17.759Z Has data issue: false hasContentIssue false

Random polymorphisms and random evolutionarily stable strategies: a comparison

Published online by Cambridge University Press:  14 July 2016

John Haigh*
Affiliation:
University of Sussex
*
Postal address: Mathematics Division, University of Sussex, Falmer, Brighton BN1 9QH, UK.

Abstract

Recently, the properties of ESSs for random payoff matrices, and stable polymorphisms for random fitness matrices, have been investigated. These problems are very closely related, and some similarities and differences are examined here. In contrast to some earlier work, non-robustness of the conclusions, to changes in the distribution of the random matrices, are found in two areas: in the asymptotic number of polymorphisms (or ESSs) whose support is a given size, and in the location of a polymorphism (or ESS) whose size of support is 2 or 3, in a large matrix.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1990 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Haigh, J. (1988) The distribution of evolutionary stable strategies. J. Appl. Prob. 25, 233246.Google Scholar
Haigh, J. (1989) How large is the support of an ESS? J. Appl. Prob. 26, 164170.Google Scholar
Kingman, J. F. C. (1989) Maximum of random quadratic forms on a simplex. In Probability, Statistics and Mathematics, ed. Anderson, T. W., Athreya, K. B. and Iglehart, D. L., Academic Press, New York.Google Scholar
Lewontin, R. C. Ginzburg, L. R. and Tuljapurkar, S. D. (1978) Heterosis as an explanation for large amounts of genic polymorphism. Genetics 88, 149170.CrossRefGoogle ScholarPubMed