Bounds on the number of ESSs of a matrix game

DOI10.1016/S0025-5564(00)00036-5zbMath0988.91015WikidataQ52073741 ScholiaQ52073741MaRDI QIDQ5933959

No author found.

Publication date: 22 July 2002

Published in: Mathematical Biosciences (Search for Journal in Brave)

zbMATH Keywords

complexityupper boundsevolutionarily stable strategiesquadratic formlower boundspayoff

Mathematics Subject Classification ID

Developmental biology, pattern formation (92C15) Evolutionary games (91A22)

Related Items

Chris Cannings: a life in games ⋮ On equilibrium properties of the replicator-mutator equation in deterministic and random games ⋮ On the distribution of the number of internal equilibria in random evolutionary games ⋮ Dominant-set clustering: a review ⋮ Entanglement and dynamic stability of Nash equilibria in a symmetric quantum game ⋮ On the expected number of internal equilibria in random evolutionary games with correlated payoff matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequential methods for generating patterns of ESS's
• ESS patterns: Adding pairs to an ESS
• ON AN INEQUALITY IN PARTIAL AVERAGES
• How large is the support of an ESS?
• Models of animal conflict
• On the number of local maxima of a constrained quadratic form
• The Logic of Animal Conflict