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

A new solution concept for two-player zero-sum matrix games with multi-dimensional payoffs is introduced. It is based on extensions of the vector order in $$\mathbb {R}^d$$Rd to order relations in the power set of $$\mathbb {R}^d$$Rd, so-called set relations, and strictly motivated by the interpretation of the payoff as multi-dimensional loss for one and gain for the other player. The new concept provides coherent worst case estimates for games with multi-dimensional payoffs. It is shown that–in contrast to games with one-dimensional payoffs–the corresponding strategies are different from equilibrium strategies for games with multi-dimensional payoffs. The two concepts are combined into new equilibrium notions for which existence theorems are given. Relationships of the new concepts to existing ones such as Shapley and vector equilibria, vector minimax and maximin solutions as well as Pareto optimal security strategies are clarified.

[1]  Matthias Ehrgott,et al.  Multicriteria Optimization (2. ed.) , 2005 .

[2]  Sophie Bade,et al.  Nash equilibrium in games with incomplete preferences , 2005 .

[3]  F. R. Fernandez,et al.  Vector linear programming in zero-sum multicriteria matrix games , 1996 .

[4]  X. X. Huang,et al.  Equivalents of an approximate variational principle for vector-valued functions and applications , 1999, Math. Methods Oper. Res..

[5]  Justo Puerto,et al.  Multicriteria Goal Games , 1998 .

[6]  A. Hamel,et al.  Set Optimization—A Rather Short Introduction , 2014, 1404.5928.

[7]  Efe A. Ok.  Utility Representation of an Incomplete Preference Relation , 2002, J. Econ. Theory.

[8]  Matthias Ehrgott,et al.  Multicriteria Optimization , 2005 .

[9]  Debasish Ghose,et al.  Solution concepts in two-person multicriteria games , 1989 .

[10]  H. W. Corley,et al.  Games with vector payoffs , 1985 .

[11]  M. Zeleny.  Games with multiple payoffs , 1975 .

[12]  Some minimax problems of vector-valued functions , 1988 .

[13]  Giuseppe De Marco,et al.  A Refinement Concept for Equilibria in multicriteria Games via Stable Scalarizations , 2007, IGTR.

[14]  Andreas Löhne,et al.  Vector Optimization with Infimum and Supremum , 2011, Vector Optimization.

[15]  Andreas Löhne,et al.  Solution concepts in vector optimization: a fresh look at an old story , 2011 .

[16]  Daishi Kuroiwa,et al.  On cone of convexity of set-valued maps , 1997 .

[17]  M. Zeleny.  Linear Multiobjective Programming , 1974 .

[18]  Tamaki Tanaka.  Vector-Valued Minimax Theorems In Multicriteria Games , 2000 .

[19]  D. Luc,et al.  A saddlepoint theorem for set - valued maps , 1989 .

[20]  Efe A. Ok,et al.  Incomplete preferences under uncertainty: Indecisiveness in beliefs versus tastes , 2012 .

[21]  Gianni Bosi,et al.  Continuous multi-utility representations of preorders , 2012 .

[22]  D. Blackwell.  An analog of the minimax theorem for vector payoffs. , 1956 .

[23]  Debasish Ghose,et al.  A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games , 1991 .

[24]  Efe A. Ok,et al.  On the multi-utility representation of preference relations ✩ , 2011 .

[25]  G. Carlier,et al.  Pareto optima and equilibria when preferences are incompletely known , 2013, J. Econ. Theory.

[26]  Luciano Campi,et al.  Multivariate utility maximization with proportional transaction costs , 2008, Finance Stochastics.

[27]  Mordechai I. Henig.  The domination property in multicriteria optimization , 1986 .

[28]  Andreas H. Hamel,et al.  Set Optimization and Applications - The State of the Art , 2015 .

[29]  Kfir Eliaz,et al.  Indifference or indecisiveness? Choice-theoretic foundations of incomplete preferences , 2006, Games Econ. Behav..

[30]  Andreas Löhne,et al.  The vector linear program solver Bensolve - notes on theoretical background , 2015, Eur. J. Oper. Res..

[31]  Jaeok Park.  Potential games with incomplete preferences , 2015 .

[32]  J. Puerto,et al.  On minimax and Pareto optimal security payoffs in multicriteria games , 2018 .

[33]  T. Maeda.  On Characterization of Nash Equilibrium Strategy in Bi-Matrix Games with Set Payoffs , 2015 .

[34]  T. Tanaka,et al.  Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions , 1994 .

[35]  L. Shapley,et al.  Equilibrium points in games with vector payoffs , 1959 .

[36]  Andreas Löhne,et al.  Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming , 2015, Math. Methods Oper. Res..

[37]  J. Nieuwenhuis,et al.  Some minimax theorems in vector-valued functions , 1983 .

[38]  A. Wierzbicki.  Multiple criteria games — Theory and applications , 1995 .

[39]  Fabio Maccheroni,et al.  Expected utility theory without the completeness axiom , 2004, J. Econ. Theory.

[40]  R. Aumann.  UTILITY THEORY WITHOUT THE COMPLETENESS AXIOM , 1962 .

[41]  Wade D. Cook,et al.  Zero‐sum games with multiple goals , 1976 .

[42]  Jingang Zhao,et al.  The equilibria of a multiple objective game , 1991 .