The Space Complexity of Mirror Games
We consider the following game between two players Alice and Bob, which we call the mirror game. Alice and Bob take turns saying numbers belonging to the set {1, 2, ...,N}. A player loses if they repeat a number that has already been said. Otherwise, after N turns, when all the numbers have been spoken, both players win. When N is even, Bob, who goes second, has a very simple (and memoryless) strategy to avoid losing: whenever Alice says x, respond with N+1-x. The question is: does Alice have a similarly simple strategy to win that avoids remembering all the numbers said by Bob?
The answer is no. We prove a linear lower bound on the space complexity of any deterministic winning strategy of Alice. Interestingly, this follows as a consequence of the Eventown-Oddtown theorem from extremal combinatorics. We additionally demonstrate a randomized strategy for Alice that wins with high probability that requires only O~(sqrt N) space (provided that Alice has access to a random matching on K_N).
We also investigate lower bounds for a generalized mirror game where Alice and Bob alternate saying 1 number and b numbers each turn (respectively). When 1+b is a prime, our linear lower bounds continue to hold, but when 1+b is composite, we show that the existence of a o(N) space strategy for Bob (when N != 0 mod (1+b)) implies the existence of exponential-sized matching vector families over Z^N_{1+b}.
Mirror Games
Space Complexity
Eventown-Oddtown
Theory of computation~Interactive computation
36:1-36:14
Regular Paper
https://arxiv.org/abs/1710.02898
Sumegha
Garg
Sumegha Garg
Princeton University, Princeton, USA
Jon
Schneider
Jon Schneider
Google Research, New York, USA
10.4230/LIPIcs.ITCS.2019.36
Sanjeev Arora and Boaz Barak. Computational complexity: a modern approach. Cambridge University Press, 2009.
Elwyn R Berlekamp, John Horton Conway, and Richard K Guy. Winning ways for your mathematical plays, volume 3. AK Peters Natick, 2003.
ER Berlekamp. On subsets with intersections of even cardinality. Canad. Math. Bull, 12(4):471-477, 1969.
Abhishek Bhowmick, Zeev Dvir, and Shachar Lovett. New bounds for matching vector families. SIAM Journal on Computing, 43(5):1654-1683, 2014.
Zeev Dvir, Parikshit Gopalan, and Sergey Yekhanin. Matching vector codes. SIAM Journal on Computing, 40(4):1154-1178, 2011.
Zeev Dvir and Sivakanth Gopi. 2-Server PIR with Subpolynomial Communication. Journal of the ACM (JACM), 63(4):39, 2016.
Klim Efremenko. 3-query locally decodable codes of subexponential length. SIAM Journal on Computing, 41(6):1694-1703, 2012.
Peter Frankl and Richard M. Wilson. Intersection theorems with geometric consequences. Combinatorica, 1(4):357-368, 1981.
Vince Grolmusz. Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs. Combinatorica, 20(1):71-86, 2000.
S Muthukrishnan. Data Streams: Algorithms and Applications (Foundations and Trends in Theoretical Computer Science). Foundations and Trends in Theoretical Computer Science, 2005.
Noam Nisan. On read-once vs. multiple access to randomness in logspace. In Structure in Complexity Theory Conference, 1990, Proceedings., Fifth Annual, pages 179-184. IEEE, 1990.
Tibor Szabó. http://discretemath.imp.fu-berlin.de/DMII-2011-12/linalgmethod.pdf, 2011.
Sumegha Garg and Jon Schneider
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode