Unified approach to approximate solutions in games and multiobjective programming (Q1072943)

Using a theorem of the second author [SIAM Rev. 23, 225-237 (1981; Zbl 0456.90091)], we derive results about approximate solutions for Nash equilibrium theory and for multiobjective problems. We describe conditions under which one can replace an infinite strategy set, an infinite alternative set, or an infinite set of criteria by a finite subset without loosing all approximate solutions of the problem under consideration.