Abstract
Using a theorem of Tijs, 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 losing all approximate solutions of the problem under consideration.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Tijs, S. H.,ε-Equilibrium Point Theorems for Two-Person Games, Methods of Operations Research, Vol. 26, pp. 775–766, 1977.
Tijs, S. H.,Nash Equilibria for Noncooperative n-Person Games in Normal Form, SIAM Review, Vol. 23, pp. 225–237, 1981.
White, D. J.,Optimality and Efficiency, John Wiley, Chichester, England, 1982.
Loridan, P.,ε-Solutions in Vector Minimization Problems, Journal of Optimization Theory and Applications, Vol. 43, pp. 265–276, 1984.
Nachbin, L.,Topology and Order, D. Van Nostrand Company, Princeton, New Jersey, 1965.
Author information
Authors and Affiliations
Additional information
Communicated by P. L. Yu
This work was done during the period when the second author was Visiting Professor of the Italian National Research Council at the Mathematical Department of the University of Pavia, Pavia, Italy.
Rights and permissions
About this article
Cite this article
Patrone, F., Tijs, S.H. Unified approach to approximate solutions in games and multiobjective programming. J Optim Theory Appl 52, 273–278 (1987). https://doi.org/10.1007/BF00941286
Issue Date:
DOI: https://doi.org/10.1007/BF00941286