Abstract
We study the complexity of computing a uniform Nash equilibrium on a non-win-lose bimatrix game. It is known that such a problem is NP-complete even if a bimatrix game is win-lose (Bonifaci et al., 2008). Fortunately, if a win-lose bimatrix game is planar, then uniform Nash equilibria always exist. We have a polynomial-time algorithm for finding a uniform Nash equilibrium of a planar win-lose bimatrix game (Addario-Berry et al., 2007). The following question is left: How hard to compute a uniform Nash equilibrium on a planar non-win-lose bimatrix game? This paper resolves this issue. We prove that the problem of deciding whether a non-win-lose planar bimatrix game has uniform Nash equilibrium is also NP-complete.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.