The exact computational complexity of evolutionarily stable strategies

DOI10.1007/978-3-642-45046-4_9MaRDI QIDQ6829016zbMATH OpenFDO

Authors Vincent Conitzer

Publication date 12 January 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45046-4_9

zbMATH Keywords

algorithmic game theoryequilibrium computationevolutionarily stable strategies

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Evolutionary games (91A22)

This page was built for publication: The exact computational complexity of evolutionarily stable strategies

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