In this paper we provide a characterization of the set of fall back equilibria for 2 x n bimatrix games. Furthermore, for this type of games we discuss the relation between the set of fall back equilibria and the sets of perfect, proper and strictly perfect equilibria. In order to do this we reformulate the existing characterizations for these three equilibrium concepts by the use of refinement-specific subgames
In this article three different types of loss aversion equilibria in bimatrix games are studied. Los...
In this paper, an alternative definition of stable sets, defined by mertens [mertens, 1989. Stable e...
AbstractWe study the fundamental problem 2NASH of computing a Nash equilibrium (NE) point in bimatri...
Fall back equilibrium is a refinement of the Nash equilibrium concept. In the underlying thought exp...
Fall back equilibrium is a refinement of the Nash equilibrium concept. In the underly- ing thought e...
In the literature several refinements of the Nash equilibrium concept have been introduced. Among th...
The perfectness and the properness concept are two refinements of the Nash equilibrium concept. Both...
In this paper a procedure is described that computes for a given bimatrix game all stable sets in th...
A class of nondegenerate n n bimatrix games is presented that have asymptotically more than 2:414n=...
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 ...
AbstractIn this note, we present a linear-time algorithm for determining pure-strategy equilibrium p...
Background. Multiple Nash equilibria bring a new problem of selecting amongst them but this problem ...
In this article three different types of loss aversion equilibria in bimatrix games are studied. Los...
In this paper, an alternative definition of stable sets, defined by mertens [mertens, 1989. Stable e...
AbstractWe study the fundamental problem 2NASH of computing a Nash equilibrium (NE) point in bimatri...
Fall back equilibrium is a refinement of the Nash equilibrium concept. In the underlying thought exp...
Fall back equilibrium is a refinement of the Nash equilibrium concept. In the underly- ing thought e...
In the literature several refinements of the Nash equilibrium concept have been introduced. Among th...
The perfectness and the properness concept are two refinements of the Nash equilibrium concept. Both...
In this paper a procedure is described that computes for a given bimatrix game all stable sets in th...
A class of nondegenerate n n bimatrix games is presented that have asymptotically more than 2:414n=...
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 ...
AbstractIn this note, we present a linear-time algorithm for determining pure-strategy equilibrium p...
Background. Multiple Nash equilibria bring a new problem of selecting amongst them but this problem ...
In this article three different types of loss aversion equilibria in bimatrix games are studied. Los...
In this paper, an alternative definition of stable sets, defined by mertens [mertens, 1989. Stable e...
AbstractWe study the fundamental problem 2NASH of computing a Nash equilibrium (NE) point in bimatri...
DOI
Add to ORKG