New algorithm for checking Pareto optimality in bimatrix games

DOI10.1007/S10479-022-04912-ZMaRDI QIDQ2678596zbMATH OpenOpenAlexWikidataFDO

Authors R. Kicsiny, Zoltan Varga

Publication date 23 January 2023

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

game theorybimatrix gamesPareto optimalitynonlinear transformchecking algorithm

Mathematics Subject Classification ID

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

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

Cites work

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

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)