Solution concepts based on security levels in constrained multicriteria convex games

MaRDI QIDQ1908920zbMATH OpenFDO

Authors Justo Puerto, Francisco Ramón Fernández García

Publication date 7 March 1996

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

Pareto-optimal security strategiescontinuous kernelmulticriteria zero-sum matrix games

Mathematics Subject Classification ID

2-person games (91A05)

Recommendations

• Solution concepts in continuous-kernel multicriteria games
• A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games
• Solution concepts in two-person multicriteria games
• On minimax and Pareto optimal security payoffs in multicriteria games
• Multicriteria goal games

Cited in

(8)

• A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games
• Solution concepts in two-person multicriteria games
• Multicriteria goal games
• Approximations and well-posedness in multicriteria games
• Set-valued TU-games
• On minimax and Pareto optimal security payoffs in multicriteria games
• Solution concepts in continuous-kernel multicriteria games
• Core solutions in vector-valued games

This page was built for publication: Solution concepts based on security levels in constrained multicriteria convex games

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