In the literature several refinements of the Nash equilibrium concept have been introduced. Among these there are: the essential equilibrium point [16], the quasi-strong equilibrium point [2], the perfect equilibrium point [15], and the proper equilibrium point [11]. In this paper bimatrix games are considered. For this class of games a new refinement of the equilibrium concept, called nondegenerate equilibrium point, is introduced. It is proved that nondegenerate equilibrium points are essential, quasi-strong, proper and perfect. Furthermore, it is shown that for almost all bimatrix games all equilibrium points are nondegenerate
AbstractIn this paper, it is shown that the structure of the set of Pareto equilibria for a bimatrix...
AbstractWeakly completely mixed bimatrix games are defined to be games with a completely mixed Nash ...
Weakly completely mixed bimatrix games are defined to be games with a completely mixed Nash componen...
The methods for finding Nash equilibrium in bimatrix game are introduced in this paper. Linear optim...
The perfectness and the properness concept are two refinements of the Nash equilibrium concept. Both...
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 ...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
In this paper we provide a characterization of the set of fall back equilibria for 2 x n bimatrix ga...
In this paper we investigate the set of correlated equilibria of bimatrix games. These equilibria ar...
In this thesis I investigate the solution concept of Nash equilibrium. This thesis is composed of th...
The most important solution concept in game theory is the Nash equilibrium (NE). However, this solut...
AbstractIn this note, we present a linear-time algorithm for determining pure-strategy equilibrium p...
Since the seminal paper of Nash (1950) game theoretic literature has focused mostly on equilibrium a...
AbstractWe study the fundamental problem 2NASH of computing a Nash equilibrium (NE) point in bimatri...
AbstractIn this paper, it is shown that the structure of the set of Pareto equilibria for a bimatrix...
AbstractWeakly completely mixed bimatrix games are defined to be games with a completely mixed Nash ...
Weakly completely mixed bimatrix games are defined to be games with a completely mixed Nash componen...
The methods for finding Nash equilibrium in bimatrix game are introduced in this paper. Linear optim...
The perfectness and the properness concept are two refinements of the Nash equilibrium concept. Both...
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 ...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
In this paper we provide a characterization of the set of fall back equilibria for 2 x n bimatrix ga...
In this paper we investigate the set of correlated equilibria of bimatrix games. These equilibria ar...
In this thesis I investigate the solution concept of Nash equilibrium. This thesis is composed of th...
The most important solution concept in game theory is the Nash equilibrium (NE). However, this solut...
AbstractIn this note, we present a linear-time algorithm for determining pure-strategy equilibrium p...
Since the seminal paper of Nash (1950) game theoretic literature has focused mostly on equilibrium a...
AbstractWe study the fundamental problem 2NASH of computing a Nash equilibrium (NE) point in bimatri...
AbstractIn this paper, it is shown that the structure of the set of Pareto equilibria for a bimatrix...
AbstractWeakly completely mixed bimatrix games are defined to be games with a completely mixed Nash ...
Weakly completely mixed bimatrix games are defined to be games with a completely mixed Nash componen...