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

Abstract

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$$ to order relations in the power set of $$\mathbb {R}^d$$ , 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.