The Big Match with a Clock and a Bit of Memory

Published Online:https://doi.org/10.1287/moor.2022.1267

References

  • [1] Amitai M (1989) Stochastic games with automata. Master’s thesis, Hebrew University, Jerusalem (in Hebrew).Google Scholar
  • [2] Blackwell D, Ferguson TS (1968) The big match. Ann. Math. Statist. 39(1):159–163.CrossrefGoogle Scholar
  • [3] Gillette D (1957) Stochastic games with zero stop probabilities. Dresher M, Tucker AW, Wolfe P, eds. Contributions to the Theory of Games III (Princeton University Press, Princeton, NJ), 179–187.Google Scholar
  • [4] Hansen KA, Ibsen-Jensen R, Koucký M (2016) The big match in small space (extended abstract). Gairing M, Savani R, eds. Proc. 9th Internat. Sympos. Algorithmic Game Theory (SAGT 2016) (Springer, Berlin), 64–76.Google Scholar
  • [5] Kohlberg E (1974) Repeated games with absorbing states. Ann. Statist. 2(4):724–738.CrossrefGoogle Scholar
  • [6] Levy Y (2012) Stochastic games with information lag. Games Econom. Behav. 74(1):243–256.CrossrefGoogle Scholar
  • [7] Mertens J, Neyman A (1981) Stochastic games. Internat. J. Game Theory 10(2):53–66.CrossrefGoogle Scholar
  • [8] Sorin S (2002) A First Course on Zero Sum Repeated Games (Springer, Berlin).Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.