Zero-sum semi-Markov games

SIAM Journal on Control and Optimization

Volumn 41, Issue 3, 2003, Pages 723-739

  Jaśkiewicz, Anna ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Bellman equation; Borel state space; Long run expected average payoff criterion; Semi markov games

Indexed keywords

BOUNDARY CONDITIONS; ITERATIVE METHODS; MARKOV PROCESSES; PROBABILITY; PROBLEM SOLVING; STATE SPACE METHODS; STOCHASTIC CONTROL SYSTEMS;

BELLMAN EQUATION; BOREL STATE SPACE; ZERO-SUM SEMI-MARKOV GAMES;

GAME THEORY;

EID: 0038803854     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/S036301290038190X     Document Type: Article

References (22)

1. A. Arapostathis, V.S. Borkar, E. Fernández-Gaucherand, M.K. Ghosh, and S.I. Marcus, Discrete-time controlled Markov processes with average cost criterion: A survey, SIAM J. Control Optim., 31 (1993), pp. 282-344.
2. E. Altman and A. Hordijk, Zero-sum Markov games and worst-case optimal control of queueing systems, Queueing Systems Theory Appl., 21 (1995), pp. 415-447.
3. E. Altman, A. Hordijk, and F.M. Spieksma, Contraction conditions for average and α-discount optimality in countable state Markov games with unbounded rewards, Math. Oper. Res., 22 (1997), pp. 588-618.
4. D.P. Bertsekas and S.E. Shreve, Stochastic Optimal Control: The Discrete Time Case, Academic Press, New York, 1978.
5. R. Cavazos-Cadena, Recent results on conditions for the existence of average optimal stationary policies, Ann. Oper. Res., 28 (1991), pp. 3-28.
6. K. Fan, Minimax theorems, Proc. Natl. Acad. Sci. USA, 39 (1953), pp. 42-47.
7. O. Hernández-Lerma and J.B. Lasserre, Discrete-Time Markov Control Processes: Basic Optimality Criteria, Springer-Verlag, New York, 1996.
8. O. Hernández-Lerma and J.B. Lasserre, Further Topics on Discrete-Time Markov Control Processes, Springer-Verlag, New York, 1999.
9. O. Hernández-Lerma, O. Vega-Amaya, and G. Carrasco, Sample-path optimality and variance-minimization of average cost Markov control processes, SIAM J. Control Optim., 38 (1999), pp. 79-93.
10. O. Hernández-Lerma and J.B. Lasserre, Zero-sum stochastic games in Borel spaces: Average payoff criteria, SIAM J. Control Optim., 39 (2001), pp. 1520-1539.
11. A. Jaśkiewicz, An approximation approach to ergodic semi-Markov control processes. Math. Methods Oper. Res., 54 (2001), pp. 1-19.
12. A. Jaśkiewicz and A.S. Nowak, On the optimality equation for zero-sum ergodic stochastic games, Math. Methods Oper. Res., 54 (2001), pp. 291-301.
13. A.K. Lal and S. Sinha, Zero-sum two person semi-Markov games, J. Appl. Probab., 29 (1992), pp. 56-72.
14. S.P. Meyn and R.L. Tweedie, Markov Chains and Stochastic Stability, Springer-Verlag, New York, 1993.
15. S.P. Meyn and R.L. Tweedie, Computable bounds for geometric convergence rates of Markov chains. Ann. Appl. Probab., 4 (1994), pp. 981-1011.
16. J. Neveu, Mathematical Foundations of the Calculus of Probability, Holden-Day. San Francisco, 1965
17. A.S. Nowak, Measurable selection theorems for minimax stochastic optimization problems, SIAM J. Control Optim., 23 (1985), pp. 466-476.
18. A.S. Nowak, Optimal strategies in a class of zero-sum ergodic stochastic games, Math. Methods Oper. Res., 50 (1999), pp. 399-420.
19. A.S. Nowak, Some remarks on equilibria in semi-Markov games, Appl. Math. (Warsaw), 27 (2000), pp. 385-394.
20. A.S. Nowak and E. Altman, ε-equilibria for stochastic games with uncountable state space and unbounded cost, SIAM J. Control Optim., 40 (2002), pp. 1821-1839.
21. S.M. Ross, Applied Probability Models with Optimization Applications, Holden-Day, San Francisco, 1970.
22. M. Schäl, Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal, Z. Wahrscheinlichkeitstheorie und Verw, Gebiete, 32 (1975), pp. 179-196.