Unified approach to approximate solutions in games and multiobjective programming

Using a theorem of Tijs, the authors derive results about approximate solutions for Nash equilibrium theory and for multiobjective problems. They 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 losing all approximate solutions of the problem under consideration.