The exact computational complexity of evolutionarily stable strategies
Publication
, Journal Article
Conitzer, V
Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
December 1, 2013
While the computational complexity of many game-theoretic solution concepts, notably Nash equilibrium, has now been settled, the question of determining the exact complexity of computing an evolutionarily stable strategy has resisted solution since attention was drawn to it in 2004. In this paper, I settle this question by proving that deciding the existence of an evolutionarily stable strategy is -complete. © 2013 Springer-Verlag.
Duke Scholars
Published In
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI
EISSN
1611-3349
ISSN
0302-9743
Publication Date
December 1, 2013
Volume
8289 LNCS
Start / End Page
96 / 108
Related Subject Headings
- Artificial Intelligence & Image Processing
- 46 Information and computing sciences
Citation
APA
Chicago
ICMJE
MLA
NLM
Conitzer, V. (2013). The exact computational complexity of evolutionarily stable strategies. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8289 LNCS, 96–108. https://doi.org/10.1007/978-3-642-45046-4_9
Conitzer, V. “The exact computational complexity of evolutionarily stable strategies.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8289 LNCS (December 1, 2013): 96–108. https://doi.org/10.1007/978-3-642-45046-4_9.
Conitzer V. The exact computational complexity of evolutionarily stable strategies. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2013 Dec 1;8289 LNCS:96–108.
Conitzer, V. “The exact computational complexity of evolutionarily stable strategies.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8289 LNCS, Dec. 2013, pp. 96–108. Scopus, doi:10.1007/978-3-642-45046-4_9.
Conitzer V. The exact computational complexity of evolutionarily stable strategies. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2013 Dec 1;8289 LNCS:96–108.
Published In
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI
EISSN
1611-3349
ISSN
0302-9743
Publication Date
December 1, 2013
Volume
8289 LNCS
Start / End Page
96 / 108
Related Subject Headings
- Artificial Intelligence & Image Processing
- 46 Information and computing sciences