Add to ORKGIn this paper a procedure is described that computes for a given bimatrix game all stable sets in the sense of Kohlberg and Mertens (1986). Further the procedure is refined to find the strictly perfect equilibria (if any) of such a game
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 ...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
In this paper a procedure is described that computes for a given bimatrix game all stable sets in th...
In this paper, an alternative definition of stable sets, defined by mertens [mertens, 1989. Stable e...
In this paper we provide a characterization of the set of fall back equilibria for 2 x n bimatrix ga...
If a connected component of perfect equilibria of a two-player game contains a stable set as defined...
In the literature several refinements of the Nash equilibrium concept have been introduced. Among th...
AbstractIn this note, we present a linear-time algorithm for determining pure-strategy equilibrium p...
A refinement of the set of Nash equilibria that satisfies two assumptions is shown to select a subse...
The perfectness and the properness concept are two refinements of the Nash equilibrium concept. Both...
[This item is a preserved copy. To view the original, visit http://econtheory.org/] A refinement of ...
AbstractIn this paper, it is shown that the structure of the set of Pareto equilibria for a bimatrix...
A refinement of the set of Nash equilibria that satisfies two assumptions is shown to select a subse...
This paper investigates the computational properties of quasi-strict equilibrium, an attractive equi...
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 ...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...
In this paper a procedure is described that computes for a given bimatrix game all stable sets in th...
In this paper, an alternative definition of stable sets, defined by mertens [mertens, 1989. Stable e...
In this paper we provide a characterization of the set of fall back equilibria for 2 x n bimatrix ga...
If a connected component of perfect equilibria of a two-player game contains a stable set as defined...
In the literature several refinements of the Nash equilibrium concept have been introduced. Among th...
AbstractIn this note, we present a linear-time algorithm for determining pure-strategy equilibrium p...
A refinement of the set of Nash equilibria that satisfies two assumptions is shown to select a subse...
The perfectness and the properness concept are two refinements of the Nash equilibrium concept. Both...
[This item is a preserved copy. To view the original, visit http://econtheory.org/] A refinement of ...
AbstractIn this paper, it is shown that the structure of the set of Pareto equilibria for a bimatrix...
A refinement of the set of Nash equilibria that satisfies two assumptions is shown to select a subse...
This paper investigates the computational properties of quasi-strict equilibrium, an attractive equi...
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 ...
Starting from the definition of a bimatrix game, we restrict the pair of strategy sets jointly, not ...