Skip to main content
Log in

A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In this paper, a scalar game is derived from a zero-sum multicriteria matrix game, and it is proved that the solution of the new game with strictly positive scalarization is a necessary and sufficient condition for a strategy to be a Pareto-optimal security strategy (POSS) for one of the players in the original game. This is done by proving that a certain set, which is the extension of the set of security level vectors in the criterion function space, is convex and polyhedral. It is also established that only a finite number of scalarizations are necessary to obtain all the POSS for a player. An example is included to illustrate the main steps in the proof.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Blackwell, D.,An Analog of the Minimax Theorem for Vector Payoffs, Pacific Journal of Mathematics, Vol. 6, No. 1, pp. 1–8, 1956.

    Google Scholar 

  2. Shapley, L. S.,Equilibrium Points in Games with Vector Payoffs, Naval Research Logistics Quarterly, Vol. 6, No. 1, pp. 57–61, 1959.

    Google Scholar 

  3. Nieuwenhuis, J. W.,Some Minimax Theorems in Vector-Valued Functions, Journal of Optimization Theory and Applications, Vol. 40, No. 3, pp. 463–475, 1983.

    Google Scholar 

  4. Corley, H. W.,Games with Vector Payoffs, Journal of Optimization Theory and Applications, Vol. 47, No. 4, pp. 491–498, 1985.

    Google Scholar 

  5. Ghose, D., andPrasad, U. R.,Solution Concepts in Two-Person Multicriteria Games, Journal of Optimization Theory and Applications, Vol. 63, No. 2, pp. 167–189, 1989.

    Google Scholar 

  6. Schmitendorf, W. E., andMoriarty, G.,A Sufficiency Condition for Coalitive Pareto-Optimal Solutions, Multicriteria Decision Making and Differential Games, Edited by G. Leitmann, Plenum Press, New York, New York, 1976.

    Google Scholar 

  7. Schmitendorf, W. E.,Optimal Control of Systems with Multiple Criteria When Disturbances Are Present, Journal of Optimization Theory and Applications, Vol. 27, No. 1, pp. 135–146, 1979.

    Google Scholar 

  8. Lin, J. G.,Maximal Vectors and Multi-Objective Optimization, Journal of Optimization Theory and Applications, Vol. 18, No. 1, pp. 41–64, 1976.

    Google Scholar 

  9. Basar, T., andOlsder, G. J.,Dynamic Noncooperative Game Theory, Academic Press, New York, New York, 1982.

    Google Scholar 

  10. Arrow, K. J., Barankin, E. W., andBlackwell, D.,Admissible Points of Convex Sets, Contributions to the Theory of Games, II, Edited by H. W. Kuhn and A. W. Tucker, Princeton University Press, Princeton, New Jersey, 1953.

    Google Scholar 

  11. Hartley, R.,On Cone Efficiency, Cone Convexity, and Cone Compactness, SIAM Journal on Applied Mathematics, Vol. 34, No. 2, pp. 211–222, 1978.

    Google Scholar 

  12. Yu, P. L.,Multiple-Criteria Decision Making: Concepts, Techniques, and Extensions, Plenum Press, New York, New York, 1985.

    Google Scholar 

  13. Rockafellar, R. T.,Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.

    Google Scholar 

  14. Akgül, M.,An Algorithmic Proof of the Polyhedral Decomposition Theorem, Naval Research Logistics, Vol. 35, No. 5, pp. 463–472, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by P. L. Yu

This work was done while the author was a Research Associate in the Department of Electrical Engineering at the Indian Institute of Science and was financially supported by the Council of Scientific and Industrial Research, Delhi, India.

The author wishes to express his gratefulness to Professor U. R. Prasad for helpful discussions and to two anonymous referees for suggestions which led to an improved presentation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ghose, D. A necessary and sufficient condition for Pareto-optimal security strategies in multicriteria matrix games. J Optim Theory Appl 68, 463–481 (1991). https://doi.org/10.1007/BF00940065

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00940065

Key Words

Navigation