The Big Match in Small Space

In this paper we study how to play (stochastic) games optimally using little space. We focus on repeated games with absorbing states, a type of two-player, zero-sum concurrent mean-payoff games. The prototypical example of these games is the well known Big Match of Gillete (1957). These games may not allow optimal strategies but they always have {\epsilon}-optimal strategies. In this paper we design {\epsilon}-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 {\epsilon}-optimal value for Player 1 in the limit superior sense. The previously known strategies use space {\Omega}(logT) and it was known that no strategy can use constant space if it is {\epsilon}-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 Abraham Neyman.

[1]  Dean Gillette,et al.  9. STOCHASTIC GAMES WITH ZERO STOP PROBABILITIES , 1958 .

[2]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[3]  E. Kalai.  Bounded Rationality and Strategic Complexity in Repeated Games , 1987 .

[4]  J. Neumann.  Zur Theorie der Gesellschaftsspiele , 1928 .

[5]  Sylvain Sorin,et al.  On Repeated Games with Complete Information , 1986, Math. Oper. Res..

[6]  Chee-Keng Yap,et al.  Fundamental problems of algorithmic algebra , 1999 .

[7]  H. Mills.  8. Marginal Values of Matrix Games and Linear Programs , 1957 .

[8]  Kristoffer Arnsfelt Hansen,et al.  Exact Algorithms for Solving Stochastic Games , 2012, ArXiv.

[9]  D. Blackwell,et al.  THE BIG MATCH , 1968, Classics in Game Theory.

[10]  Philippe Flajolet,et al.  Approximate counting: A detailed analysis , 1985, BIT.

[11]  Robert H. Morris,et al.  Counting large numbers of events in small registers , 1978, CACM.

[12]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[13]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[14]  E. Kohlberg.  Repeated Games with Absorbing States , 1974 .

[15]  Kristoffer Arnsfelt Hansen,et al.  Winning Concurrent Reachability Games Requires Doubly-Exponential Patience , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[16]  R. Aumann.  Survey of Repeated Games , 1981 .

[17]  Robert J. Aumann,et al.  Essays in game theory and mathematical economics in honor of Oskar Morgenstern , 1981 .

[18]  Jean-Michel Coulomb,et al.  Generalized "Big-Match" , 1999, Math. Oper. Res..

[19]  H. Young,et al.  Handbook of Game Theory with Economic Applications , 2015 .

[20]  S. Sorin.  A First Course on Zero Sum Repeated Games , 2002 .