Approximate saddle points of constrained vector-valued games

The determination of saddle points is an interesting study in the area of game theory with multiple objectives. In this paper, we have studied similar problems for approximate determination of saddle points for multiobjective games up to ∈(∈ > 0). The concepts of approximate solutions, earlier were introduced by White and Loridan. In the course of such analysis, the approximate equilibrium point of vector-valued game is associated with approximate saddle points of certain multiobjective programming problems. The necessary and sufficient type of optimality conditions are also given.