Skip to main content

Markov (Multistage) Games

  • Chapter
  • First Online:
Two-Person Zero-Sum Games

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 201))

  • 1999 Accesses

Abstract

In games that involve a sequence of moves, it can be useful to regard certain payoffs as themselves being games, and those payoffs might in turn have other games as payoffs, or possibly even the original game as a payoff. The idea of representing a game in this manner is often parsimonious and natural. The Inspection Game is a prototype.

Great fleas have little fleas upon their backs to bite ‘em,

and little fleas have lesser fleas, and so ad infinitum.

Augustus de Morgan

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 119.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

References

  • Baston, V., & Bostok, F. (1993). Infinite deterministic graphical games. SIAM J. Control and Optimization, 31(6), 1623–1629.

    Article  Google Scholar 

  • Berkovitz, L., & Dresher, M. (1959). A game theory analysis of tactical air war. Operations Research, 7(5), 599–620.

    Article  Google Scholar 

  • Blackwell, D. (1954). On multi-component attrition games. Naval Research Logistics, 1(3), 210–16.

    Article  Google Scholar 

  • Dresher, M. 1962 A sampling inspection problem in arms control agreements: a game theory approach. Memorandum RM-2972-ARPA, RAND, Santa Monica, CA.

    Google Scholar 

  • Everett, H. 1957 Recursive games. Contributions to the theory of games III (Ann. Math. Studies 39, eds. M. Dresher, A. Tucker, and P. Wolfe) 47–78, Princeton U. Press.

    Google Scholar 

  • Ferguson, T., & Melolidakis, C. (1998). On the inspection game. Naval Research Logistics, 45(3), 327–334.

    Article  Google Scholar 

  • Friedman, Y. (1977). Optimal strategy for the one-against-many battle. Operations Research, 25(5), 884–888.

    Article  Google Scholar 

  • Gale, D. and F. Stewart 1953. Infinite games with perfect information. Contributions to the theory of games II (Ann. Math. Studies 28, eds. H. Kuhn and A. Tucker), Princeton U. Press.

    Google Scholar 

  • Guy, R. (Ed.). (1991). Combinatorial Games. Rhode Island: American Mathematical Society.

    Google Scholar 

  • Ho, Y., Bryson, A., & Baron, S. (1965). Differential games and optimal pursuit-evasion strategies. IEEE Transactions on Automatic Control, 10(4), 385–389.

    Article  Google Scholar 

  • Isaacs, R. 1965. Differential Games, Wiley.

    Google Scholar 

  • Isbell, J., & Marlow, W. (1956). Attrition games. Naval Research Logistics, 3(1–2), 71–94.

    Article  Google Scholar 

  • Isler, V., Kannan, S., & Khanna, S. (2005). Randomized pursuit-evasion in a polygonal environment. IEEE Transactions on Robotics, 5(21), 864–875.

    Google Scholar 

  • Kikuta, K. (1983). A note on the one-against-many battle. Operations Research, 31(5), 952–956.

    Article  Google Scholar 

  • Kikuta, K. (1986). The matrix game derived from the many-against-many battle. Naval Research Logistics, 33(4), 603–612.

    Article  Google Scholar 

  • Ladany, S. and R. Machol (eds.) 1977. Optimal Strategies in Sports. North Holland.

    Google Scholar 

  • Mertens, J., & Neyman, A. (1981). Stochastic games have a value. Int. J. of Game Theory, 10(1), 53–66.

    Article  Google Scholar 

  • Owen, G. 1995. Game Theory (third edition). Academic Press.

    Google Scholar 

  • Pultr, A. and F. Morris 1984. Prohibiting repetition makes playing games substantially harder. Intl. J. Game Theory 13 27–40.

    Google Scholar 

  • Raghavan, T., & Filar, J. (1991). Algorithms for stochastic games–a survey. Methods and Models of Operations Research, 35(6), 437–472.

    Google Scholar 

  • Schwartz, E. (1979). An improved computational procedure for optimal allocation of aircraft sorties. Operations Research, 27(3), 621–627.

    Article  Google Scholar 

  • Shilov, G. 1965. Mathematical Analysis 44–45, Pergamon.

    Google Scholar 

  • Thomas, C., & Deemer, W. (1957). The role of operational gaming in operations research. Operations Research, 5(1), 1–27.

    Article  Google Scholar 

  • U.S. Air Force (Studies and Analysis). 1971. Methodology for use in measuring the effectiveness of general purpose forces (an algorithm for approximating the game theoretical value of N-staged games). Report Saber Grand (Alpha).

    Google Scholar 

  • Washburn, A. (1990). Deterministic graphical games. Journal of Mathematical Analysis and Applications., 153(1), 84–96.

    Article  Google Scholar 

  • Winston, W. 2009. Mathletics. Princeton U. Press.

    Google Scholar 

  • Zermelo, E. 1912. Ãœber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. Proceedings of the fifth International Congress of Mathematicians, 501–510, Cambridge U. Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this chapter

Cite this chapter

Washburn, A. (2014). Markov (Multistage) Games. In: Two-Person Zero-Sum Games. International Series in Operations Research & Management Science, vol 201. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-9050-0_4

Download citation

Publish with us

Policies and ethics