Mixed Strategies in Vector Optimization and Germeier’s Convolution

Resumo

The simplest two-criteria examples of a vector optimization problem and a zero-sum game are considered to study the adequacy of using mixed strategies if the linear convolution is replaced by the Germeier’s convolution (the inverse logical convolution) for parametrizing the set of optimal solutions or values of the game and also for estimating the payoffs of all participants. It is shown that the linear convolution yields different results in a comparison with the averaged inverse logical convolution. The issues of stochastic vector optimization and various conceptual formalizations for the value of multi-criteria mixed strategies games are discussed.