Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T23:44:08.758Z Has data issue: false hasContentIssue false

How large is the support of an ESS?

Published online by Cambridge University Press:  14 July 2016

John Haigh*
Affiliation:
University of Sussex
*
∗ Postal address: Mathematics Division, School of Mathematical and Physical Sciences, University of Sussex, Falmer, Brighton BN1 9QH, UK.

Abstract

Suppose the payoffs (aij ) in the n × n matrix A are drawn independently from some continuous probability distribution. The number of tactics used in an ESS is investigated. Asymptotic results on the size of the ESS with largest support are given, using the work of Karlin and Kingman on the size of polymorphisms in one-locus multi-allele diploid selection models.

Information

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1989 

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.)

Article purchase

Temporarily unavailable