| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438101 | Theoretical Computer Science | 2008 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
