Sensitive equilibria for ergodic stochastic games with countable state spaces

Mathematical Methods of Operations Research

Volumn 50, Issue 1, 1999, Pages 65-76

  Nowak, Andrzej S ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Countable state space; Sensitive optimality; Stochastic games; Unbounded payoffs

Indexed keywords

EID: 0002839892     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/pl00020927     Document Type: Article

References (38)

1. Altman E (1996) Nonzero-sum stochastic games in admission, service and routing control in queueing systems. QUESTA 23:259-279
2. Altman E, Hordijk A, Spieksma FM (1997) Contraction conditions for average and α-discount optimality in countable state Markov games with unbounded rewards. Math. Oper. Res. 22:588-618
3. Blackwell D (1962) Discrete dynamic programming. Ann. Math. Statist. 33:719-726
4. Borkar VS, Ghosh MK (1993) Denumerable state stochastic games with limiting average payoff. J. Optim. Theory Appl. 76:539-560
5. Brown BW (1965) On the iterative method of dynamic programming on a finite space discrete time Markov processes. Ann. Math. Statist. 36:1279-1285
6. Carlson D, Haurie A, Leizarowitz A (1994) Overtaking equilibria for switching regulator and tracking games. In: A (eds.) Advances in dynamic games and applications, A (eds.) Basai T, Haurie Annals of Dynamic Games 1:247-268
7. Cavazos-Cadena R, Lasserre JB (1988) Strong 1-optimal stationary policies in denumerable Markov decision processes. Systems Control Letters 11:65-71
8. Dekker K, Hordijk A (1992) Recurrence conditions for average and Blackwell optimality in denumerable state Markov chains. Math. Oper. Res. 17:271-289
9. Denardo EV, Miller BL (1968) An optimality condition for discrete dynamic programming with no discounting. Ann. Math. Statist. 39:1220-12.27
10. Federgruen A (1978) On n-person stochastic games with denumerable state space. Adv. Appl. Probab. 10:452-471
11. Filar JA, Vrieze K (1997) Competitive Markov decision processes. Springer-Verlag, New York
12. Flynn J (1976) Conditions for the equivalence of optimality criteria in dynamic programming. Ann. Statist. 4:936-953
13. Gale D (1967) On optimal development in a multisector economy. Re. Econ. Studies 34:1-19
14. Glicksberg (1952) A further generalization of the Kakutani fixed point theorem with application to Nash equilibrium points. Proc. Amer. Math. Soc. 3:170-174
15. Hernández-Lerma O, Lasserre JB (1996) Discrete-time Markov control processes: Basic optimality criteria. Springer-Verlag, New York
16. Hernández-Lerma O, Vega-Amaya O (1998) Infinite horizon Markov control processes with undiscounted cost criteria: from average to overtaking optimality. Applications Matheraaticae 25:153-178
17. Lippman SA (1968) Criterion equivalence in discrete dynamic programming. Oper. Res. 17:920-923
18. Meyn SP, Tweedie RL (1993) Markov chains and stochastic stability Springer-Verlag, New York
19. Meyn SP, Tweedie RL (1994) Computable bounds for geometric convergence rates of Markov chains. Ann. Appl. Probab. 4:981-1011
20. Maitra A, Sudderth WD (1996) Discrete gambling and stochastic games. Springer-Verlag, New York
21. Mertens JF, Neyman A (1981) Stochastic games. Internat. J. Game Theory 10:53-66
22. Nowak AS (1999) Optimal strategies in a class of zero-sum ergodic stochastic games. Math. Methods of Oper. Res.
23. Nowak AS (1999) A note on strong 1-optimal policies in Markov decision chains with unbouneded costs. Math. Methods of Oper. Res. 49:475-482
24. Nowak AS, Vega-Amaya O (1999) A counterexample on overtaking optimality. Math. Methods of Oper. Res. 49:435-439
25. Parthasarathy T (1973) Discounted, positive and noncooperative stochastic games. Internat. J. Game Theory 2:25-37
26. Popov N (1977) Conditions for geometric ergodicity of countable Markov chains. Soviet Math. Dokl. 18:676-679
27. Ramsey FP (1928) A mathematical theory of savings. Economic J. 38:543-559
28. Rieder U (1991) Non-cooperative dynamic games with general utility functions. In: Raghavan TES, Ferguson TS, Parthasarathy T, Vrieze OJ (eds.) Stochastic Games and Related Topics, Kluwer Acad. Publishers, Dordrecht, The Netherlands, pp. 161-174
29. Royden HL (1968) Real analysis. MacMillan, London
30. Rubinstein A (1979) Equilibria in supergames with the overtaking criterion. J. Economic Theory 21:1-9
31. Sennott LI (1994) Nonzero-sum stochastic games with unbounded costs: discounted and average cost cases. Z. Oper. Res. 40:145-162
32. Spieksma FM (1990) Geometrically ergodic Markov chains and the optimal control of queues. Ph.D. thesis, Leiden University, The Netherlands
33. Thuijsman F, Vrieze OJ (1987) The bad match, a total reward stochastic game. OR Spectrum 9:93-99
34. Veinott AF (1966) On finding optimal policies in discrete dynamic programming with no discounting. Ann. Math. Statist. 37:1284-1294
35. Vieille N (1997) 2-player stochastic games 1: a reduction. Cahiers du Ceremade, Paris
36. Vieille N (1997) 2-player stochastic games 2: the case of recursive games. Cahiers du Ceremade, Paris
37. Vieille N (1997) Large deviations and stochastic games. Cahiers du Ceremade, Paris
38. von Weizsäcker CC (1965) Existence of optimal programs of accumulation for an infinite horizon. Review of Econom. Studies 32:85-104