arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1710.02898cs.CCcs.DM
收藏

镜像对策的空间复杂度

The space complexity of mirror games

Sumegha Garg, Jon Schneider

摘要:

我们考虑两个玩家Alice和Bob之间的简单流游戏,我们称之为镜像游戏。在这个游戏中,Alice和Bob轮流说出属于集合$\{1, 2, \dots,2N\}$的数字。如果玩家重复已经说过的数字,他们就输了。第二个出场的鲍勃有一个非常简单(而且没有记忆)的策略来避免失败:每当爱丽丝说$x$时,就用$2N+1-x$回应。问题是:爱丽丝是否有一个类似的简单策略来避免记住鲍勃说的所有数字?答案是否定的。我们证明了一个线性下界的空间复杂度的任何确定性获胜策略的爱丽丝。有趣的是,这是极值组合学中的Eventown-Oddtown定理的结果。我们还证明了一个随机化的策略,爱丽丝赢得了高概率,只需要$\tilde{O}(\sqrt N)$空间(前提是爱丽丝有机会在$K_{2N}$随机匹配)。我们还调查了一个广义的镜像游戏,爱丽丝和鲍勃交替说$1$号码和$b$号码每轮(分别)的下限。当$1+b$是一个素数,我们的线性下界继续举行,但当$1+b$是复合材料,我们表明,存在一个$o(N)$空间策略鲍勃意味着存在指数大小的匹配向量家族在$\mathbb{Z}^N_{1+b}$。

英文摘要:

We consider a simple streaming game between two players Alice and Bob, which we call the mirror game. In this game, Alice and Bob take turns saying numbers belonging to the set $\{1, 2, \dots,2N\}$. A player loses if they repeat a number that has already been said. Bob, who goes second, has a very simple (and memoryless) strategy to avoid losing: whenever Alice says $x$, respond with $2N+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 $\tilde{O}(\sqrt N)$ space (provided that Alice has access to a random matching on $K_{2N}$). 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 implies the existence of exponential-sized matching vector families over $\mathbb{Z}^N_{1+b}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑