Skip to main content
SpringerLink
Log in

Perfect information stochastic games and related classes

  • Published:
International Journal of Game Theory Aims and scope Submit manuscript

Abstract

Forn-person perfect information stochastic games and forn-person stochastic games with Additive Rewards and Additive Transitions (ARAT) we show the existence of pure limiting average equilibria. Using a similar approach we also derive the existence of limiting average ε-equilibria for two-person switching control stochastic games. The orderfield property holds for each of the classes mentioned, and algorithms to compute equilibria are pointed out.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Evangelista FS, Raghavan TES, Vrieze OJ (1994) Repeated ARAT games. In: Ferguson TS, Shapley LS (eds.) Statistics, probability and game theory, IMS Lecture Notes-Monograph Series, vol 30, pp. 13–28

  • Filar JA (1981) Ordered field property for stochastic games when the player who controls transitions changes from state to state. J Opt Theory Appl34: 503–515

    Google Scholar 

  • Flesch J, Thuijsman F, Vrieze OJ (1996) Recursive repeated games with absorbing states. Math Oper Res 21: 1016–1022

    Google Scholar 

  • Liggett TM, Lippman SA (1969) Stochastic games with perfect information and time average payoff. SIAM Review11: 604–607

    Google Scholar 

  • Mertens JF, Neyman A (1981) Stochastic games. Int J Game Theory10: 53–66

    Google Scholar 

  • Raghavan TES, Tijs SH, Vrieze OJ (1985) On stochastic games with additive reward and transition structure. J Opt Theory Appl47:451–464

    Google Scholar 

  • Thuijsman F (1992) Optimality and Equilibria in Stochastic Games. CWI-tract 82, Centre for Mathematics and Computer Science, Amsterdam

    Google Scholar 

  • Vrieze OJ, Tijs SH, Raghavan TES, Filar JA (1983) A finite algorithm for the switching control stochastic game. OR Spektrum5: 15–24

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Maastricht University, P.O. Box 616, 6200, MD Maastricht, The Netherlands

    Frank Thuijsman

  2. Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, 851 South Morgan Room 517, 60607-7045, Chicago, IL, USA

    Thirukkannamangai E. S. Raghavan

Authors
  1. Frank Thuijsman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thirukkannamangai E. S. Raghavan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

We gratefully acknowledge valuable remarks by J. Flesch and by anonymous referees on earlier versions.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thuijsman, F., Raghavan, T.E.S. Perfect information stochastic games and related classes. Int J Game Theory 26, 403–408 (1997). https://doi.org/10.1007/BF01263280

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01263280

Keywords

Search

Navigation