Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game in extensive form and corresponding mathematical programming problem (Q960113)

The paper considers games in extensive form where agents have vector payoffs (or multi--objectives). The lack of a standard utility function makes simple optimization impossible. Therefore, one usually applies a Pareto criterium for individual optimality: a decision is optimal if it is impossible to improve all criteria simultaneously. An extension of this idea uses certain domination cones. The authors study such games in extemsive form and characterize the corresponding nondominated equilibria via the usual Kuhn--Tucker like consitions for vector maximization. The main contribution of the paper is that they derive a linear programming problem that allows to find nondominated equilibria.