arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1904.09888math.OCecon.TH
收藏

Penney游戏赔率:从无套利角度

Penney's Game Odds From No-Arbitrage

University of Melbourne(墨尔本大学)

Joshua B. Miller

AI总结:

本文利用无套利论证推导Penney游戏中任意两个不同三翻转模式的获胜赔率,等价于Conway的“领先数”算法,并给出直观解释。

摘要:

Penney游戏是一个两人零和游戏,每个玩家选择一个由正面和反面组成的三翻转模式,获胜者是公平硬币重复投掷中其模式首先出现的玩家。由于玩家顺序选择,后手具有优势。事实上,对于任何三翻转模式,存在另一个三翻转模式更有可能首先出现。本文提供了一个新颖的无套利论证,生成对应于任意一对不同模式的获胜赔率。所得公式等价于Conway的“领先数”算法生成的公式。伴随的投注赔率直觉增加了对Conway算法为何有效的洞察。证明简单且易于推广到涉及多于两个结果、不等概率以及不同长度竞争模式的游戏。还给出了关于Penney游戏预期持续时间的额外结果。

英文摘要:

Penney's game is a two-player zero-sum game in which each player chooses a three-flip pattern of heads and tails, and the winner is the player whose pattern occurs first in repeated tosses of a fair coin. Because the players choose sequentially, the second mover has the advantage. In fact, for any three-flip pattern, there is another three-flip pattern that is strictly more likely to occur first. This paper provides a novel no-arbitrage argument that generates the winning odds corresponding to any pair of distinct patterns. The resulting formula is equivalent to that generated by Conway's ``leading number'' algorithm. The accompanying betting-odds intuition adds insight into why Conway's algorithm works. The proof is simple and easy to generalize to games involving more than two outcomes, unequal probabilities, and competing patterns of various lengths. Additional results on the expected duration of Penney's game are presented.

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

↑