On some vector valued Markov game

  • Kensuke Tanaka


The optimization problem of a two-person zero-sum discounted Markov game having vector valued loss function is investigated. The optimization criterion of the game is made from the domination structure determined by some convex coneD. In this paper, the state space of the game process is a countable set and the action spaces of the players are compact metric spaces. We use the scalarization of loss function by a weighting factor for the players to establish the optimal strategies under certain assumptions on the loss function and the transition probability measure. So we prove that the saddle point of the resulting zero-sum discounted numerical game is aD-saddle point for an initial Markov game. Conversely, under some additional conditions, anyD-saddle point is a saddle point of a numerical loss function by a weighting factor. Further, the relations ofD-saddle point, sub-gradient of the upper support function, and super-gradient of the lower support function are discussed.

Key words

Markov game D-saddle point contraction operator 


  1. [1]
    J. P. Aubin, Mathematical Methods of Game and Economic Theory. North-Holland, Amsterdam, 1979.MATHGoogle Scholar
  2. [2]
    P. Billingsley, Convergence of Probability Measures. Wiley, New York, 1968.MATHGoogle Scholar
  3. [3]
    K. Fan, Fixed point and minimax theorem in locally convex topological linear space. Proc. Nat. Acad. Sci. U.S.A.,88 (1952), 121–126.CrossRefGoogle Scholar
  4. [4]
    K. Fan, Minimax theorems. Proc. Nat. Acad. Sci. U.S.A.,39 (1953), 42–47.MATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    R. B. Holmes, Geometric Functional Analysis and its Applications. Springer-Verlag, New York, 1975.MATHGoogle Scholar
  6. [6]
    H. C. Lai and K. Tanaka, On aD-convex solution of a cooperativem-person discounted Markov game J. Math. Anal. Appl. (to appear).Google Scholar
  7. [7]
    A. Maitra and T. Parthasarathy, On stochastic games. J. Optim. Theory Appl.,5 (1970), 289–300.MATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    M. Sion, On general minimax theorems. Pacific J. Math.,8 (1958), 171–176.MATHMathSciNetGoogle Scholar
  9. [9]
    L. S. Shapley, Equilibrium points in games with vector payoffs. Naval Res. Logistic Quart.,6 (1959), 57–61.CrossRefMathSciNetGoogle Scholar
  10. [10]
    K. Tanaka and H. C. Lai, A two-person zero-sum Markov game with a stopped set. J. Math. Anal. Appl.,68 (1982), 54–68.CrossRefMathSciNetGoogle Scholar
  11. [11]
    P. L. Yu, Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives J. Optim. Theory Appl.,14 (1974), 319–377.MATHCrossRefGoogle Scholar

Copyright information

© JJAM Publishing Committee 1985

Authors and Affiliations

  • Kensuke Tanaka
    • 1
  1. 1.Department of Mathematics, Faculty of ScienceNiigata UniversityNiigataJapan

Personalised recommendations