Abstract
In this paper we present a new solution concept for multiple objective problems which generalizes the balance points introduced by Galperin (1992). We apply this solution concept, called utopian efficiency, for solving multiple criteria matrix games. For these games it is shown how to get the whole set of utopian efficient strategies by means of multiobjective linear programs. Finally, we derive a decision criterion which is based on no ”a priori” information for choosing a strategy out of the proposed set.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benson,H.P. (1979): “An Improved Definition of Proper Efficiency for Vector Minimization with respect to Cones”, Journal of Mathematical Analysis and Applications, 71, 232–241.
Cook,W.D. (1976): “Zero-Sum Games with Multiple Goals”, Naval Research Logistics Quarterly, 23, 615–621.
Fernândez,F.R., Puerto, J. (1996): “Vector Linear Programming in Zero-Sum Multicriteria Matrix Games”, Journal of Optimization Theory and Applications, 89, 115–127.
Galperin, E.A. (1992): “Nonscalarized Multiobjective Global Optimization”, Journal of Optimization Theory and Applications, 75, 69–85.
Geoffrion, A.M. (1968): “Proper Efficiency and the Theory of Vector Maximization”, Journal of Mathematical Analysis and Applications, 22, 618–630.
Ghose, D. (1991): “A Necessary and Sufficient Condition for Pareto-Optimal Security Strategies in Multicriteria Matrix Games”. Journal of Optimization Theory and Applications, 68, 463–481.
Ghose, D., Prassad, U.R. (1989): “Solutions Concepts in Two-person Multicriteria Games”, Journal of Optimization Theory and Applications, 63, 167–189.
Hannan,E.L. (1982): “Reformulating Zero-Sum Games with Multiple Goals”, Naval Research Logistics Quarterly, 29, 113–118.
News, K.H. (1996): “A Note on the Equivalence of Balance Points and Pareto Solutions in Multiple Objective Programming”, accepted in Journal of Optimization Theory and Applications.
Kaliszewski,I. (1987): “A Modified Weighted Tchebycheff Metric for Multiple Objective Programming”. Computer Operations Research, 19, 315–323.
Steuer,R.E. (1983): Operating Manual for the ADBASE Multiple Objective Linear Programming Package. College of Business Administration, University of Georgia, Athens, Georgia.
Steuer, R.E. (1986): Multiple Criteria Optimization: Theory, Computation and Application, Willey, New York.
Steuer,R.E.,Choo,E.U. (1986): “An Interactive Weighted Tchebycheff Procedure for Multiple Objective Programming”, Mathematical Programming, 26, 326–344.
Zeleny, M. (1974): “A Concept of Compromise Solutions and the Method of the Displaced Ideal”, International Journal of Computers and Operations Research, 1, 479–496.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernández, F.R., Mármol, A.M., Monroy, L., Puerto, J. (1997). Utopian Efficient Strategies in Multicriteria Matrix Games. In: Caballero, R., Ruiz, F., Steuer, R. (eds) Advances in Multiple Objective and Goal Programming. Lecture Notes in Economics and Mathematical Systems, vol 455. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46854-4_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-46854-4_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63599-4
Online ISBN: 978-3-642-46854-4
eBook Packages: Springer Book Archive