Recommendations
Cites work
- AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
- scientific article; zbMATH DE number 3661140 (Why is no real title available?)
- scientific article; zbMATH DE number 4183223 (Why is no real title available?)
- scientific article; zbMATH DE number 3062449 (Why is no real title available?)
- scientific article; zbMATH DE number 3062450 (Why is no real title available?)
- scientific article; zbMATH DE number 3062451 (Why is no real title available?)
- Maximal nash subsets for bimatrix games
- Non-cooperative games
- On nash subsets and mobility chains in bimatrix games
- On stability of perfect equilibrium points
- On strictly perfect sets
- On the set of proper equilibria of a bimatrix game
- On the structure of the set of perfect equilibria in bimatrix games
- Persistent equilibria in strategic games
- Reexamination of the perfectness concept for equilibrium points in extensive games
- Refinements of the Nash equilibrium concept
Cited in
(11)- Classification of two-person ordinal bimatrix games
- A note on determining pure-strategy equilibrium points of bimatrix games
- Pareto curves of multidimensional mean-payoff games
- On comparing equilibrium and optimum payoffs in a class of discrete bimatrix games
- On loss aversion in bimatrix games
- New algorithm for checking Pareto optimality in bimatrix games
- Fall back equilibrium for \(2 \times n\) bimatrix games
- scientific article; zbMATH DE number 19354 (Why is no real title available?)
- scientific article; zbMATH DE number 1934375 (Why is no real title available?)
- On the set of proper equilibria of a bimatrix game
- Vector-valued games: characterization of equilibria in matrix games
This page was built for publication: Pareto equilibria for bimatrix games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802491)
