论 Litt 博弈公平的情形
On cases where Litt's game is fair
AI总结:
本文研究 Litt 博弈的公平性条件,通过构造交换双方得分的双射,证明当两个词具有相同自相关结构时,对任意抛掷次数博弈公平,且互相关不影响结果。
摘要:
一枚公平硬币被抛掷 $n$ 次,并给定两个长度相同的正面与反面有限序列(词)$A$ 和 $B$。每当词 $A$ 出现在硬币抛掷序列中时,Alice 得一分;每当词 $B$ 出现时,Bob 得一分。谁更可能获胜?这个谜题是最近在 Twitter 上引起热议的 Litt 博弈的轻微扩展。我们通过构造一个交换 Bob 和 Alice 得分的双射,证明对于任意 $n$ 以及任意两个具有相同自相关结构的词,Litt 博弈都是公平的;在这种情况下,互相关并不起作用这一事实可能会令人惊讶。
英文摘要:
A fair coin is flipped $n$ times, and two finite sequences of heads and tails (words) $A$ and $B$ of the same length are given. Each time the word $A$ appears in the sequence of coin flips, Alice gets a point, and each time the word $B$ appears, Bob gets a point. Who is more likely to win? This puzzle is a slight extension of Litt's game that recently set Twitter abuzz. We show that Litt's game is fair for any value of $n$ and any two words that have the same auto-correlation structure by building up a bijection that exchanges Bob and Alice scores; the fact that the inter-correlation does not come into play in this case may come up as a surprise.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。