Abstract
In this paper, we show that it is NP-complete to decide whether two bimatrix games share a common Nash equilibrium. Furthermore, it is co-NP-hard to decide whether two bimatrix games have exactly the same set of Nash equilibria.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have