对抗明手玩家的镜像博弈
Mirror Games Against an Open Book Player
AI总结:
本文研究镜像博弈中随机策略的秘密随机性需求,证明无秘密且记忆受限的明手 Alice 无法高效保平,Bob 可以接近 1-2^{-c/2} 的概率获胜。
摘要:
镜像博弈由 Garg 和 Schnieder(ITCS 2019)提出。Alice 和 Bob 轮流(Alice 先手)从集合 {1,2,...,2n} 中报出数字。如果一名玩家选取了此前已经出现过的数字,则该玩家落败,另一名玩家获胜。如果所有数字都在不重复的情况下被报出,则结果为平局。Bob 拥有一种简单的镜像策略,可保证自己不会落败,而且不需要任何记忆。另一方面,Garg 和 Schenier 证明,为了确保平局,每个确定性 Alice 都需要大小关于 n 呈线性的记忆。关于概率策略,先前工作表明,在一个模型中,Alice 可以访问 {1,2,...,2n} 上的一个秘密随机完美匹配,这使她能够仅使用 polylog 比特记忆,以至少 1-1/n 的概率在博弈中取得平局。我们证明,对秘密比特的需求至关重要:对于一个没有任何秘密的“明手”Alice(Bob 知道她的记忆,但不知道未来的硬币抛掷结果),且其记忆至多为 n/4c 比特(其中任意 c>2),存在一个 Bob 能以接近 1-2^{-c/2} 的概率获胜。
英文摘要:
Mirror games were invented by Garg and Schnieder (ITCS 2019). Alice and Bob take turns (with Alice playing first) in declaring numbers from the set {1,2, ...2n}. If a player picks a number that was previously played, that player loses and the other player wins. If all numbers are declared without repetition, the result is a draw. Bob has a simple mirror strategy that assures he won't lose and requires no memory. On the other hand, Garg and Schenier showed that every deterministic Alice needs memory of size linear in $n$ in order to secure a draw. Regarding probabilistic strategies, previous work showed that a model where Alice has access to a secret random perfect matching over {1,2, ...2n} allows her to achieve a draw in the game w.p. a least 1-1/n and using only polylog bits of memory. We show that the requirement for secret bits is crucial: for an `open book' Alice with no secrets (Bob knows her memory but not future coin flips) and memory of at most n/4c bits for any c>2, there is a Bob that wins w.p. close to 1-2^{-c/2}.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。