Approximations in dynamic zero-sum games I

SIAM Journal on Control and Optimization

Volumn 34, Issue 1, 1996, Pages 311-328

  Tidball, Mabel M ^a,b   Altman, Eitan ^b  

^a UNIVERSIDAD NACIONAL DE ROSARIO   (Argentina)

^b INRIA   (France)

Author keywords

Approximations; Stochastic games; Zero sum games

Indexed keywords

APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; DYNAMIC PROGRAMMING; OPTIMIZATION; RANDOM PROCESSES;

DISCOUNT FACTOR; HORIZON PROBLEMS; STOCHASTIC GAMES; ZERO SUM GAMES;

GAME THEORY;

EID: 0029771680     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/S036301299325534X     Document Type: Article

References (32)

1. E. ALTMAN, Asymptotic properties of constrained Markov decision processes, Z. Oper. Res., 37 (1993), pp. 151-170.
2. _, Denumerable constrained Markov decision problems and finite approximations, Math. Oper. Res., 19 (1994), pp. 169-191.
3. _, Flow control using the theory of zero-sum Markov games, IEEE Trans. Automatic Control, 39 (1994), pp. 814-818.
4. _, Monotonicity of optimal policies in a zero sum game: A flow control model, in Advances in Dynamic Games and Applications, T. Basar and A. Haurie, eds., Birkhäuser, Boston, 1964, pp. 269-286.
5. E. ALTMAN AND G. KOOLE, Stochastic scheduling games with Markov decision arrival processes, Comput. Math. Appl., 9 (1993), pp. 141-148.
6. M. BARDI, M. FALCONE, AND P. SORAVIA, Fully discrete schemes for the value function of pursuit-evasion games, Annals of the International Society of Dynamic Games, 1 (1993), pp. 89-105.
7. P. BERNHARD AND J. SHINAR, On finite approximation of a game solution with mixed strategies, Appl. Math. Lett., 3 (1990), pp. 1-4.
8. T. BEWLEY AND E. KOHLBERG, The asymptotic theory of stochastic games, Math. Oper. Res., 1 (1976), pp. 197-208.
9. D. BLACKWELL AND T. FERGUSON, The big match, Annals of Mathematical Statistics, 39 (1968), pp. 159-163.
10. V. S. BORKAR, A convex analytic approach to Markov decision processes, Probab. Theory Related Fields, 78 (1988), pp. 583-602.
11. R. CAVAZOS-CADENA, Finite-state approximations for denumerable state discounted Markov decision processes, J. Appl. Math. Optim., 14 (1986), pp. 27-47.
12. A. FEDERGRUEN, On N-person stochastic games with denumerable state space, Adv. in Appl. Prob., 10 (1978), pp. 452-471.
13. V. A. GAITSGORY AND A. A. PERVOZVANSKII, Perturbation theory for mathematical programming problems, J. Optim. Theory Appl., 49 (1986), pp. 389-410.
14. D. GILLETTE, Stochastic games with zero stop probabilities, Ann. Math. Studies 39, M. Dresher, A. W. Tucker, P. Wolfe, eds., Princeton University Press, Princeton, 1957, pp. 179-187.
15. O. HERNANDEZ-LERMA, Finite state approximations for denumerable multidimensional-state discounted Markov decision processes, J. Math. Anal. Appl., 113 (1986), pp. 382-389.
16. O. HERNANDEZ-LERMA, Adaptive Control of Markov Processes, Springer-Verlag, New York, 1989.
17. A. HORDIJK, O. VRIEZE, AND G. WANDROOU, Semi-Markov strategies in stochastic games, Mathematical Centre Report BW 68/76, 1976.
18. A. S. NOWAK, On zero-sum stochastic games with general state space I, Probab. Math. Stat., IV (1984), pp. 13-32.
19. _, Approximation Theorems for zero-sum nonstationary stochastic games, Proc. of the American Math. Soc., 92 (1984), pp. 418-424.
20. _, Existence of equilibrium stationary strategies in discounted noncooperative stochastic games with uncountable state space, J. Optim. Theory Appl., 45 (1985), pp. 592-602.
21. O. POURTALLIER AND M. TIDBALL, A discrete scheme of pursuit-evasion games, in preparation.
22. O. POURTALLIER AND B. TOLWINSKY, Discretization of Isaacs equation: A convergence result, (1994), in preparation.
23. H. ROYDEN, Real Analysis, Macmillan, New York, 1963.
24. L. S. SHAPLEY, Stochastic games, Proc. Nat. Acad. Sci. U.S.A., 39 (1953), pp. 1095-1100.
25. M. TIDBALL AND R. L. V. GONZÁLEZ, Zero sum differential games with stopping times. Some results about its numerical resolution, Annals of the International Society of Dynamic Games, 1 (1993), pp. 106-124.
26. L. C. THOMAS AND D. STENGOS, Finite state approximation algorithms for average cost denumerable state Markov decision processes, OR Spektrum, 7 (1985), pp. 27-37.
27. J. VAN DER WAL, Successive approximations for average reward Markov games, Internat. J. Game Theory, 9 (1980), pp. 13-24.
28. J. WESSELS, Markov Games with unbounded rewards, Dynamische Optimierung, M. Schäl, ed., Bonner Mathematische Schriften, 98, Univ. Bonn, Bonn (1977).
29. D. J. WHITE, Finite state approximations for denumerable state infinite horizon discounted Markov decision processes, J. Math. Anal. Appl., 74 (1980), pp. 292-295.
30. _, Finite state approximations for denumerable state infinite horizon discounted Markov decision processes with unbounded rewards, J. Math. Anal. Appl., 86 (1982), pp. 292-306.
31. W. WHITT, Approximations of Dynamic Programs, I, Math. Oper. Res., 3 (1978), pp. 231-243.
32. _, Representation and approximation of noncooperative sequential games, SIAM J. Control Optim., 18 (1980), pp. 33-43.