arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.2212math.PR
收藏

一个模式匹配硬币博弈的马尔可夫链分析

A Markov Chain Analysis of a Pattern Matching Coin Game

James Brofos

摘要:

2014年5月下旬,我收到一封同事的电子邮件,向我介绍了一个由Walter Penney开发的非传递游戏。本文从掷硬币博弈的角度探讨了这种概率博弈,并进一步讨论了由马尔可夫链分析产生的一些类似的有趣性质。特别是,我们通过利用基本矩阵来计算预期在游戏的每个变体中进行的“回合”的数量。此外,我推导出一种新的方法来计算概率优势的球员以下彭尼的战略。我还产生了一个详尽的证明,彭尼的战略是最佳的,他的同名游戏。

英文摘要:

In late May of 2014 I received an email from a colleague introducing to me a non-transitive game developed by Walter Penney. This paper explores this probability game from the perspective of a coin tossing game, and further discusses some similarly interesting properties arising out of a Markov Chain analysis. In particular, we calculate the number of "rounds" that are expected to be played in each variation of the game by leveraging the fundamental matrix. Additionally, I derive a novel method for calculating the probabilistic advantage obtained by the player following Penney's strategy. I also produce an exhaustive proof that Penney's strategy is optimal for his namesake game.

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

↑