Skip to main content

On Minimax and Maximin Values in Multicriteria Games

  • Conference paper
Multi-Objective Programming and Goal Programming

Part of the book series: Advances in Soft Computing ((AINSC,volume 21))

  • 1114 Accesses

Abstract

The paper is concerned with a multicriteria game whose payoff takes its values in an ordered vector space. As compare with usual single-criterion games, useful results in such classical games do not always hold as to multicriteria games. For example, minimax and maximin values are coincident under certain conditions in usual single-criterion games, but their values are not always coincident under similar conditions in multicriteria games. Therefore, in this paper, we propose a certain coincidence condition on minimax and maximin values under suitable setting in multicriteria games.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. W. Corley. (1985) Games with Vector Payoffs. Journal of Optimization Theory and Applications. 47, 491–498

    MathSciNet  Google Scholar 

  2. A. S. Karwat. (1986) On Existence of Cone-Maximal Points in Real Topological Linear Spaces. Israel Journal of Mathematics. 54, 33–41

    MATH  Google Scholar 

  3. D. T. Luc. (1989) An Existence Theorem in Vector Optimization. Mathematics of Operations Research. 14, 693–699

    Google Scholar 

  4. L. A. Petrosjan, N. A. Zenkevich (1996) Game Theory. World Scientific, Singapore

    Book  Google Scholar 

  5. T. Tanaka. (1994) Generalized Quasiconvexities, Cone Saddle Points, and Minimax Theorem for Vector-Valued Functions. Journal of Optimization Theory and Applications. 81, 355–377

    Google Scholar 

  6. T. Tanaka. (1994) Minimax Theorems of Vector-Valued Functions. Nonlinear analysis and mathematical economics (in Japanese), Kyoto. 861, 180–196

    Google Scholar 

  7. T. Tanaka. (2000) Vector-Valued Minimax Theorems in Multicriteria Games. New Frontiers of Decision Making for the Information Technology Era, World Scientific, Singapore. 75–99

    Google Scholar 

  8. T. Tanaka, M. Higuchi. (2000) Classification of Matrix Types for Multicriteria Two-Person Zero-Sum Matrix Games. Control Applications of Optimization 2000, Pergamon, New York. 2, 659–668

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Higuchi, M., Tanaka, T. (2003). On Minimax and Maximin Values in Multicriteria Games. In: Multi-Objective Programming and Goal Programming. Advances in Soft Computing, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36510-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-36510-5_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00653-4

  • Online ISBN: 978-3-540-36510-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics