On the computational complexity of evolution

Published 30 May 2015 in cs.CC and cs.GT | (1506.00095v2)

Abstract: It is well-known that the problem of recognizing an ESS in a symmetric bimatrix game is coNP-complete. In this paper, we show that recognizing an ESS even in doubly symmetric bimatrix games is also coNP-complete. Our result further implies that recognizing asymptotically stable equilibria of the replicator dynamic in this class of games is also a coNP-complete problem.

Abstract PDF Upgrade to Chat

Authors (1)

Ioannis Avramopoulos

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.