Skip to main content

“Big Match” with Lack of Information on One Side (III)

  • Chapter
Stochastic Games And Related Topics

Part of the book series: Theory and Decision Library ((TDLC,volume 7))

Abstract

We prove the existence of a minmax for a class of stochastic games with incomplete information on one side by using an auxiliary one shot game.

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.

References

  1. Blackwell, D. (1956). An Analog of the Minimax Theorem for Vector Payoffs Pacific Journal of Mathematics, 6, 1–8.

    Article  Google Scholar 

  2. Blackwell, D. and T. S. Ferguson (1968). The Big Match, Annals of Mathematical Statistics, 39, 159–163.

    Article  Google Scholar 

  3. Melolidakis, C. (1984). Ph.D. Thesis, UCLA.

    Google Scholar 

  4. Mertens, J. F. (1987). Repeated Games, Proceeding of the International Congress of Mathematicians, Berkeley (1986), 1528-1577.

    Google Scholar 

  5. Mertens, J. F., S. Sorin and S. Zamir(1987). “Repeated Games“, book to appear.

    Google Scholar 

  6. Mertens, J. F. and S. Zamir (1976). On a Repeated Game without a Recursive Structure, International Journal of Game Theory, 5, 173–182.

    Article  Google Scholar 

  7. Sorin, S. (1984). “Big match” with Lack of Information on One Side (Part I), International Journal of Game Theory, 13, 201–255.

    Article  Google Scholar 

  8. Sorin, S. (1985). “Big match” with Lack of Information on One Side (Part II), International Journal of Game Theory, 14, 173–204.

    Article  Google Scholar 

  9. Sorin, S. (1987). More on the ‘Big match’ with Lack of Information on One Side, manuscript.

    Google Scholar 

  10. Waternaux, C. (1983). Solution for a Class of Games without Recursive Structure, International Journal of Game Theory, 12, 129–160.

    Article  Google Scholar 

  11. Waternaux, C. (1983). Minmax and Maxmin of Repeated Games without a Recursive Structure, Core D. P. 8313.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Sorin, S., Zamir, S. (1991). “Big Match” with Lack of Information on One Side (III). In: Raghavan, T.E.S., Ferguson, T.S., Parthasarathy, T., Vrieze, O.J. (eds) Stochastic Games And Related Topics. Theory and Decision Library, vol 7. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3760-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-3760-7_9

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-5673-1

  • Online ISBN: 978-94-011-3760-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics