DOIAbstract
AbstractIn 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
AbstractIn 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
This paper is a self-contained survey of algorithms for comput-ing Nash equilibria of two-person gam...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
In this paper we initiate the study of the computational complexity of Nash equilibria in bimatrix g...
AbstractIn this paper, we show that it is NP-complete to decide whether two bimatrix games share a c...
The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix game is an impo...
We revisit the complexity of deciding, given a bimatrix game, whether it has a Nash equilibrium with...
We exhibit a polynomial reduction from the problem of finding a Nashequilibrium of a bimatrix game w...
We are interested in the complexity of finding Nash equilibria with one uniformly mixed strategy (th...
AbstractWe study the fundamental problem 2NASH of computing a Nash equilibrium (NE) point in bimatri...
By proving that the problem of computing a 1=n(1)-approximate Nash equilibrium remains PPAD-complete...
We investigate the complexity of finding uniformly mixed Nash equilibria (that is, equilibria in whi...
Exploiting the algebraic structure of the set of bimatrix games, a divide-and-conquer algo-rithm for...
This thesis concerns the computational problem of finding one Nash equilibrium of a bimatrix game, a...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
Exploiting the algebraic structure of the set of bimatrix games, a divide-and-conquer algorithm for ...
This paper is a self-contained survey of algorithms for comput-ing Nash equilibria of two-person gam...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
In this paper we initiate the study of the computational complexity of Nash equilibria in bimatrix g...
AbstractIn this paper, we show that it is NP-complete to decide whether two bimatrix games share a c...
The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix game is an impo...
We revisit the complexity of deciding, given a bimatrix game, whether it has a Nash equilibrium with...
We exhibit a polynomial reduction from the problem of finding a Nashequilibrium of a bimatrix game w...
We are interested in the complexity of finding Nash equilibria with one uniformly mixed strategy (th...
AbstractWe study the fundamental problem 2NASH of computing a Nash equilibrium (NE) point in bimatri...
By proving that the problem of computing a 1=n(1)-approximate Nash equilibrium remains PPAD-complete...
We investigate the complexity of finding uniformly mixed Nash equilibria (that is, equilibria in whi...
Exploiting the algebraic structure of the set of bimatrix games, a divide-and-conquer algo-rithm for...
This thesis concerns the computational problem of finding one Nash equilibrium of a bimatrix game, a...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
Exploiting the algebraic structure of the set of bimatrix games, a divide-and-conquer algorithm for ...
This paper is a self-contained survey of algorithms for comput-ing Nash equilibria of two-person gam...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
In this paper we initiate the study of the computational complexity of Nash equilibria in bimatrix g...
Add to ORKG