New algorithm for checking Pareto optimality in bimatrix games

DOI10.1007/S10479-022-04912-ZzbMATH Open1506.91034OpenAlexW4294225337WikidataQ113904537 ScholiaQ113904537MaRDI QIDQ2678596FDOQ2678596

R. Kicsiny, Zoltan Varga

Publication date: 23 January 2023

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-022-04912-z

Recommendations

• Pareto equilibria for bimatrix games
• Publication:3479838
• Seeking the equilibrium situations in bimatrix games
• On comparing equilibrium and optimum payoffs in a class of discrete bimatrix games
• Pareto-optimal security strategies as minimax strategies of a standard matrix game

zbMATH Keywords

game theorybimatrix gamesPareto optimalitynonlinear transformchecking algorithm

Mathematics Subject Classification ID

2-person games (91A05) Algorithmic game theory and complexity (91A68)

Cites Work

• Proper efficiency and the theory of vector maximization
• Backward induction algorithm for a class of closed-loop Stackelberg games
• Computer science and decision theory
• Strong Nash equilibria and mixed strategies
• Serial dictatorship and Pareto optimality
• Introduction to the theory of games. Concepts, methods, applications
• Two-person non-zero-sum games as multicriteria goal games
• Classification of two-person ordinal bimatrix games
• Multi-objective Stackelberg game model for water supply networks against interdictions with incomplete information
• Complexity of finding Pareto-efficient allocations of highest welfare
• Pareto-Nash-Stackelberg game and control theory. Intelligent paradigms and applications
• Solution for a class of closed-loop leader-follower games with convexity conditions on the payoffs

This page was built for publication: New algorithm for checking Pareto optimality in bimatrix games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2678596)