Pareto-optimal security strategies as minimax strategies of a standard matrix game

DOI10.1023/A:1021854814980zbMath0954.91002OpenAlexW2513233822MaRDI QIDQ1306667

Mark Voorneveld

Publication date: 9 February 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021854814980

zbMATH Keywords

Pareto-optimal security strategiesmulticriteria matrix games

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05)

Related Items (6)

Refinement of pure Pareto Nash equilibria in finite multicriteria games using preference relations ⋮ On minimax and Pareto optimal security payoffs in multicriteria games ⋮ Properly efficient Nash equilibrium in multicriteria noncooperative games ⋮ Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game and corresponding mathematical programming problem ⋮ Study on venture problem of potential optimal pure strategy solution for grey interval number matrix game ⋮ A BARGAINING MODEL FOR FINITE N-PERSON MULTI-CRITERIA GAMES

Cites Work

• A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games
• Solution concepts in two-person multicriteria games
• An amalgation of games
• Vector linear programming in zero-sum multicriteria matrix games
• Unnamed Item

This page was built for publication: Pareto-optimal security strategies as minimax strategies of a standard matrix game