Pareto equilibria for bimatrix games
From MaRDI portal
Publication:1802491
DOI10.1016/0898-1221(93)90277-3zbMATH Open0778.90088OpenAlexW2123104788MaRDI QIDQ1802491FDOQ1802491
Peter Borm, Stef Tijs, M. J. M. Jansen, Jos Potters
Publication date: 21 July 1993
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://research.tilburguniversity.edu/en/publications/4c66db1e-0888-4798-aacf-add0a26699c9
Recommendations
Cites Work
- Non-cooperative games
- Reexamination of the perfectness concept for equilibrium points in extensive games
- Maximal nash subsets for bimatrix games
- On strictly perfect sets
- AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
- Title not available (Why is that?)
- On the structure of the set of perfect equilibria in bimatrix games
- Refinements of the Nash equilibrium concept
- On the set of proper equilibria of a bimatrix game
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Persistent equilibria in strategic games
- Title not available (Why is that?)
- On nash subsets and mobility chains in bimatrix games
- On stability of perfect equilibrium points
Cited In (10)
- Title not available (Why is that?)
- On comparing equilibrium and optimum payoffs in a class of discrete bimatrix games
- A note on determining pure-strategy equilibrium points of bimatrix games
- Pareto curves of multidimensional mean-payoff games
- Classification of two-person ordinal bimatrix games
- New algorithm for checking Pareto optimality in bimatrix games
- On loss aversion in bimatrix games
- Title not available (Why is that?)
- Fall back equilibrium for \(2 \times n\) bimatrix games
- On the set of proper equilibria of a bimatrix game
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)
