arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1208.1329cs.GTmath.PR
收藏

乘法游戏

The multiplication game

Kent E. Morrison

摘要:

乘法游戏是一个两人游戏,其中每个玩家选择一个正整数,而不知道另一个玩家的数字。然后将这两个数字相乘,乘积的第一位数决定获胜者。我们不直接分析这个博弈,而是考虑一个密切相关的博弈,在这个博弈中,参与者选择1到10之间的正实数,将它们相乘,如果必要的话,移动小数点,这样结果就在1到10之间。混合策略是在这个区间上的概率分布,并且证明了对于两个玩家来说,从Benford分布中选择他们的数字是最优的。此外,这个策略对于任何获胜集都是最优的,获胜的概率是参与者获胜集的Benford测度。使用这些结果,我们证明了原来的游戏中,玩家选择整数有一个明确的价值观和战略存在,是任意接近最优。最后,我们考虑推广的游戏中,玩家选择元素从一个紧凑的拓扑群,并显示,选择他们根据哈尔措施是一个最优策略。

英文摘要:

The multiplication game is a two-person game in which each player chooses a positive integer without knowledge of the other player's number. The two numbers are then multiplied together and the first digit of the product determines the winner. Rather than analyzing this game directly, we consider a closely related game in which the players choose positive real numbers between 1 and 10, multiply them together, and move the decimal point, if necessary, so that the result is between 1 and 10. The mixed strategies are probability distributions on this interval, and it is shown that for both players it is optimal to choose their numbers from the Benford distribution. Furthermore, this strategy is optimal for any winning set, and the probability of winning is the Benford measure of the player's winning set. Using these results we prove that the original game in which the players choose integers has a well-defined value and that strategies exist that are arbitrarily close to optimal. Finally, we consider generalizations of the game in which players choose elements from a compact topological group and show that choosing them according to Haar measure is an optimal strategy.

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

↑