The Big Match in Small Space

(Extended Abstract)
  • Kristoffer Arnsfelt Hansen
  • Rasmus Ibsen-Jensen
  • Michal Koucký
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9928)

Abstract

We study repeated games with absorbing states, a type of two-player, zero-sum concurrent mean-payoff games with the prototypical example being the Big Match of Gillete (1957). These games may not allow optimal strategies but they always have \(\varepsilon \)-optimal strategies. In this paper we design \(\varepsilon \)-optimal strategies for Player 1 in these games that use only \(O(\log \log T)\) space. Furthermore, we construct strategies for Player 1 that use space s(T), for an arbitrary small unbounded non-decreasing function s, and which guarantee an \(\varepsilon \)-optimal value for Player 1 in the limit superior sense. The previously known strategies use space \(\varOmega (\log T)\) and it was known that no strategy can use constant space if it is \(\varepsilon \)-optimal even in the limit superior sense. We also give a complementary lower bound. Furthermore, we also show that no Markov strategy, even extended with finite memory, can ensure value greater than 0 in the Big Match, answering a question posed by Neyman [11].

References

  1. 1.
    Aumann, R.J.: Survey of repeated games. In: Bohm, V. (ed.) Essays in Game Theory and Mathematical Economics in Honor of Oskar Morgenstern, Gesellschaft, Recht, Wirtschaft, vol. 4, pp. 11–42. Bibliographisches Institut, Mannheim (1981)Google Scholar
  2. 2.
    Blackwell, D., Ferguson, T.S.: The big match. Ann. Math. Stat. 39(1), 159–163 (1968)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Flajolet, P.: Approximate counting: a detailed analysis. BIT 25(1), 113–134 (1985)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Gillette, D.: Stochastic games with zero stop probabilities. Contrib. Theor. Games III, Ann. Math. Stud. 39, 179–187 (1957)MathSciNetMATHGoogle Scholar
  5. 5.
    Hansen, K., Koucký, M., Miltersen, P.: Winning concurrent reachability games requires doubly exponential patience. In: Proceedings of LICS, pp. 332–341 (2009)Google Scholar
  6. 6.
    Hansen, K.A., Ibsen-Jensen, R., Koucký, M.: The big match in small space (full version) (2016). CoRR abs/1604.07634Google Scholar
  7. 7.
    Ibsen-Jensen, R.: Strategy complexity of two-player, zero-sum games. Ph.D. thesis, Aarhus University (2013)Google Scholar
  8. 8.
    Kalai, E.: Bounded rationality and strategic complexity in repeated games. In: Game Theory and Applications, pp. 131–157. Academic Press (1990)Google Scholar
  9. 9.
    Kohlberg, E.: Repeated games with absorbing states. Ann. Statist. 2(4), 724–738 (1974)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Morris, R.: Counting large numbers of events in small registers. Commun. ACM 21(10), 840–842 (1978)MATHCrossRefGoogle Scholar
  11. 11.
    Neyman, A.: Personal communication (2015)Google Scholar
  12. 12.
    Shapley, L.: Stochastic games. Proc. Natl. Acad. Sci. U. S. A. 39, 1095–1100 (1953)MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Sorin, S.: Repeated games with complete information. In: Handbook of Game Theory with Economic Applications, vol. 1, chap. 4, pp. 71–107. Elsevier, 1edn. (1992)Google Scholar
  14. 14.
    Sorin, S.: A First Course on Zero Sum Repeated Games. Springer, Heidelberg (2002)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Kristoffer Arnsfelt Hansen
    • 1
  • Rasmus Ibsen-Jensen
    • 2
  • Michal Koucký
    • 3
  1. 1.Aarhus UniversityAarhusDenmark
  2. 2.IST AustriaKlosterneuburgAustria
  3. 3.Charles UniversityPragueCzech Republic

Personalised recommendations