A set optimization approach to zero-sum matrix games with multi-dimensional payoffs

DOI10.1007/s00186-018-0639-zzbMath1418.91021arXiv1701.08514OpenAlexW2584533292WikidataQ129802527 ScholiaQ129802527MaRDI QIDQ1631178

Andreas H. Hamel, Andreas Löhne

Publication date: 5 December 2018

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

Full work available at URL: https://arxiv.org/abs/1701.08514

zbMATH Keywords

multi-objective programmingzero-sum gameset optimizationset relationincomplete preferencemulti-dimensional payoff

Mathematics Subject Classification ID

Noncooperative games (91A10) Multi-objective and goal programming (90C29) 2-person games (91A05)

Related Items (8)

Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems ⋮ Global well-posedness of set-valued optimization with application to uncertain problems ⋮ On global well-posedness of semi-infinite set optimization problems ⋮ Multicriteria competitive games as models in operations research ⋮ On robustness for set-valued optimization problems ⋮ Mixed strategies in vector optimization and Germeier's convolution ⋮ Editorial. Choosing sets: preface to the special issue on set optimization and applications ⋮ Decision making and games with vector outcomes

Uses Software

• BENSOLVE

Cites Work

• Unnamed Item
• Technical note: Games with vector payoffs
• An analog of the minimax theorem for vector payoffs
• Potential games with incomplete preferences
• A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games
• Some minimax problems of vector-valued functions
• The domination property in multicriteria optimization
• Solution concepts in two-person multicriteria games
• Some minimax theorems in vector-valued functions
• The equilibria of a multiple objective game
• Linear multiobjective programming
• Games with multiple payoffs
• Multicriteria goal games
• Optimality conditions for set-valued optimization problems
• Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
• The vector linear program solver Bensolve -- notes on theoretical background
• On minimax and Pareto optimal security payoffs in multicriteria games
• Nash equilibrium in games with incomplete preferences
• Vector linear programming in zero-sum multicriteria matrix games
• Set Optimization—A Rather Short Introduction
• On Characterization of Nash Equilibrium Strategy in Bi-Matrix Games with Set Payoffs
• Incomplete Preferences Under Uncertainty: Indecisiveness in Beliefs versus Tastes
• Vector Optimization with Infimum and Supremum
• Solution concepts in vector optimization: a fresh look at an old story
• A REFINEMENT CONCEPT FOR EQUILIBRIA IN MULTICRITERIA GAMES VIA STABLE SCALARIZATIONS
• A saddlepoint theorem for set-valued maps
• Zero-sum games with multiple goals
• On cone convexity of set-valued maps
• Multicriteria Optimization
• Utility Theory without the Completeness Axiom

This page was built for publication: A set optimization approach to zero-sum matrix games with multi-dimensional payoffs