AbstractIn this note, we present a linear-time algorithm for determining pure-strategy equilibrium points of bimatrix games. In addition, we show that three mathematical programs are linear-time solvable
The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix game is an impo...
Background. Multiple Nash equilibria bring a new problem of selecting amongst them but this problem ...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
AbstractIn this note, we present a linear-time algorithm for determining pure-strategy equilibrium p...
A formula is presented for computing the equilibrium payoffs in a generic finite two-person game whe...
It is known that finding a Nash equilibrium for win-lose bimatrix games, i.e., two-player games wher...
AbstractWe focus on the problem of computing an ϵ-Nash equilibrium of a bimatrix game, when ϵ is an ...
It is known that finding a Nash equilibrium for win-lose bimatrixgames, i.e., two-player garnes wher...
AbstractWe study the fundamental problem 2NASH of computing a Nash equilibrium (NE) point in bimatri...
This thesis concerns the computational problem of finding one Nash equilibrium of a bimatrix game, a...
Abstract. We focus on the problem of computing an ɛ-Nash equilibrium of a bimatrix game, when ɛ is a...
Abstract In the article the task of finding the most preferred mixed strategies in finite sc...
The rank of a bimatrix game is the matrix rank of the sum of the two payoff matrices. This paper com...
We focus on the problem of computing an ɛ-Nash equilibrium of a bimatrix game, when ɛ is an absolute...
The methods for finding Nash equilibrium in bimatrix game are introduced in this paper. Linear optim...
The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix game is an impo...
Background. Multiple Nash equilibria bring a new problem of selecting amongst them but this problem ...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
AbstractIn this note, we present a linear-time algorithm for determining pure-strategy equilibrium p...
A formula is presented for computing the equilibrium payoffs in a generic finite two-person game whe...
It is known that finding a Nash equilibrium for win-lose bimatrix games, i.e., two-player games wher...
AbstractWe focus on the problem of computing an ϵ-Nash equilibrium of a bimatrix game, when ϵ is an ...
It is known that finding a Nash equilibrium for win-lose bimatrixgames, i.e., two-player garnes wher...
AbstractWe study the fundamental problem 2NASH of computing a Nash equilibrium (NE) point in bimatri...
This thesis concerns the computational problem of finding one Nash equilibrium of a bimatrix game, a...
Abstract. We focus on the problem of computing an ɛ-Nash equilibrium of a bimatrix game, when ɛ is a...
Abstract In the article the task of finding the most preferred mixed strategies in finite sc...
The rank of a bimatrix game is the matrix rank of the sum of the two payoff matrices. This paper com...
We focus on the problem of computing an ɛ-Nash equilibrium of a bimatrix game, when ɛ is an absolute...
The methods for finding Nash equilibrium in bimatrix game are introduced in this paper. Linear optim...
The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix game is an impo...
Background. Multiple Nash equilibria bring a new problem of selecting amongst them but this problem ...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
DOI
Add to ORKG