Skip to main content

Classification and Basic Tools

  • Conference paper
Book cover Stochastic Games and Applications

Part of the book series: NATO Science Series ((ASIC,volume 570))

Abstract

A stochastic game is a multi-stage game played in discrete time where, at each stage, the stage game played depends upon a parameter called state. The value of the state evolves as a function of its current value and the actions of the players. Let I be the finite set of players and S be the set of states. For each state z in S, an I-player normal form game is specified by action sets A i(z) for each player i in I and reward functions r i(z,.), i in I, from the set of action profiles at z, A (z) = Π iɛI A i(z) to the reals, ℝ. In addition, for any pair consisting of a state z in S and an action profile a in A(z), a probability p(.|z,a) on S describes the random transition.

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
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Reference

  1. Aumann, R.J. (1964) Mixed and behavior strategies in infinite extensive games, in M. Dresher, L.S. Shapley and A.W. Tucker (eds.), Advances in Game Theory, Annals of Mathematics Studies 52, Princeton University Press, Princeton, NJ, pp. 627–650.

    Google Scholar 

  2. Aumann, R.J. and Maschler, M. (1995) Repeated Games with Incomplete Information (with the collaboration of R. E. Stearns), MIT Press, Cambridge, MA.

    Google Scholar 

  3. Blackwell, D. (1962) Discrete dynamic programming, Annals of Mathematical Statistics 33 719–726.

    Article  MathSciNet  MATH  Google Scholar 

  4. Coulomb, J.-M. (2003) Absorbing games with a signalling structure, in A. Ney-man and S. Sorin (eds.), Stochastic Games and Applications, NATO Science Series C, Mathematical and Physical Sciences, Vol. 570, Kluwer Academic Publishers, Dordrecht, Chapter 22, pp. 335–355.

    Google Scholar 

  5. Dubins, L.E. and Savage, L.J. (1976) Inequalities for Stochastic Processes: How to Gamble if You Must, Dover, Mineola, NY.

    MATH  Google Scholar 

  6. Everett, H. (1957) Recursive games, in M. Dresher, A.W. Tucker and P. Wolfe (eds.), Contributions to the Theory of Games, Vol. III, Annals of Mathematics Studies 39, Princeton University Press, Princeton, NJ, pp. 47–78.

    Google Scholar 

  7. Filar, J. and Vrieze, O.J. (1997) Competitive Markov Decision Processes, Springer-Verlag, Berlin.

    MATH  Google Scholar 

  8. Kohlberg, E. (1974) Repeated games with absorbing states, Annals of Statistics 2, 724–738.

    Article  MathSciNet  MATH  Google Scholar 

  9. Kuhn, H.W. (1953) Extensive games and the problem of information, in H.W. Kuhn and A.W. Tucker (eds.), Contributions to the Theory of Games, Vol. II, Annals of Mathematics Studies 28, Princeton University Press, Princeton, NJ, pp. 193–216.

    Google Scholar 

  10. Lehrer, E. and Sorin, S. (1998) e-consistent equilibrium in repeated games, International Journal of Game Theory 27, 231–244.

    Article  MathSciNet  MATH  Google Scholar 

  11. Maitra, A. and Sudderth, W. (1996) Discrete Gambling and Stochastic Games, Springer, Berlin.

    Book  MATH  Google Scholar 

  12. Maitra, A. and Sudderth, W. (2003) Stochastic games with lim sup payoff, in A. Ney–man and S. Sorin (eds.), Stochastic Games and Applications, NATO Science Series C, Mathematical and Physical Sciences, Vol. 570, Kluwer Academic Publishers, Dordrecht, Chapter 23, pp. 357–366.

    Google Scholar 

  13. Maitra, A. and Sudderth, W. (2003) Stochastic games with Borel payoffs, in A. Ney-man and S. Sorin (eds.), Stochastic Games and Applications, NATO Science Series C, Mathematical and Physical Sciences, Vol. 570, Kluwer Academic Publishers, Dordrecht, Chapter 24, pp. 367–373.

    Google Scholar 

  14. Mertens, J.-F., Sorin, S. and Zamir, S. (1994) Repeated games. CORE Discussion Papers 9420, 9421, 9422, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.

    Google Scholar 

  15. Ney–man, A. (2003) Stochastic games: Existence of the minmax, in A. Ney–man and S. Sorin (eds.), Stochastic Games and Applications, NATO Science Series C, Mathematical and Physical Sciences, Vol. 570, Kluwer Academic Publishers, Dordrecht, Chapter 11, pp. 173–193.

    Google Scholar 

  16. Nowak, A.S. (2003) Zero-sum stochastic games with Borel state spaces, in A. Ney-man and S. Sorin (eds.), Stochastic Games and Applications, NATO Science Series C, Mathematical and Physical Sciences, Vol. 570, Kluwer Academic Publishers, Dordrecht, Chapter 7, pp. 77–91.

    Google Scholar 

  17. Puterman, M. (1994) Markov Decision Processes, Wiley, New York.

    Book  MATH  Google Scholar 

  18. Raghavan, T.E.S. (2003) Finite-step algorithms for single-controller and perfect information stochastic games, in A. Ney–man and S. Sorin (eds.), Stochastic Games and Applications, NATO Science Series C, Mathematical and Physical Sciences, Vol. 570, Kluwer Academic Publishers, Dordrecht, Chapter 15, pp. 227–251.

    Google Scholar 

  19. Shapley, L.S. (1953) Stochastic games, Proceedings of the National Academy of Sciences of the U.S.A. 39, 1095–1100 (Chapter 1 in this volume).

    MathSciNet  Google Scholar 

  20. Sorin, S. (2003) Discounted stochastic games: The finite case, in A. Ney–man and S. Sorin (eds.), Stochastic Games and Applications, NATO Science Series C, Mathematical and Physical Sciences, Vol. 570, Kluwer Academic Publishers, Dordrecht, Chapter 5, pp. 51–55.

    Google Scholar 

  21. Sorin, S. (2003) Stochastic games with incomplete information, in A. Ney–man and S. Sorin (eds.), Stochastic Games and Applications, NATO Science Series C, Mathematical and Physical Sciences, Vol. 570, Kluwer Academic Publishers, Dordrecht, Chapter 25, pp. 375–395.

    Google Scholar 

  22. Sorin, S. (2003) The operator approach to zero-sum stochastic games, in A. Ney-man and S. Sorin (eds.), Stochastic Games and Applications, NATO Science Series C, Mathematical and Physical Sciences, Vol. 570, Kluwer Academic Publishers, Dordrecht, Chapter 27, pp. 417–426.

    Google Scholar 

  23. Vrieze, O.J. (2003) Stochastic games, practical motivation and the orderfield prop-erty for special classes, in A. Ney–man and S. Sorin (eds.), Stochastic Games and Applications, NATO Science Series C, Mathematical and Physical Sciences, Vol. 570, Kluwer Academic Publishers, Dordrecht, Chapter 14, pp. 215–225.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media New York

About this paper

Cite this paper

Sorin, S. (2003). Classification and Basic Tools. In: Neyman, A., Sorin, S. (eds) Stochastic Games and Applications. NATO Science Series, vol 570. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0189-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-94-010-0189-2_3

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-1493-2

  • Online ISBN: 978-94-010-0189-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics