On the Support Size of Stable Strategies in Random Games

DOI10.1007/978-3-540-74871-7_14MaRDI QIDQ3608508zbMATH OpenOpenAlexFDO

Authors Spyros Kontogiannis, P. G. Spirakis

Publication date 5 March 2009

Published in Stochastic Algorithms: Foundations and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74871-7_14

zbMATH Keywords

bimatrix gamesevolutionary gamesevolutionary stable strategiesNash equilibria

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15) Evolutionary games (91A22)

Recommendations

• On the support size of stable strategies in random games
• Algorithms and Computation
• Evolutionarily stable strategies of random games, and the vertices of random polygons
• How large is the support of an ESS?
• The distribution of evolutionarily stable strategies

Cited in

(7)

• On the support size of stable strategies in random games
• Evolutionarily stable strategies of random games, and the vertices of random polygons
• The distribution of evolutionarily stable strategies
• How large is the support of an ESS?
• scientific article; zbMATH DE number 6988869 (Why is no real title available?)
• Random polymorphisms and random evolutionarily stable strategies: a comparison
• Algorithms and Computation

This page was built for publication: On the Support Size of Stable Strategies in Random Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608508)