非传递骰子的游戏
A Game of Nontransitive Dice
AI总结:
本文研究了一个两人同时行动的游戏,其中每位玩家选择一个n面的骰子,当n>3时,存在唯一的纯策略纳什均衡,即每个玩家都选择标准n面骰子,每个面有不同的数字。
摘要:
我们考虑一个两位玩家同时行动的游戏,其中每位玩家各自选择任何允许的n面骰子,其中n是一个固定的整数。如果玩家掷出的结果大于对手的结果,则玩家获胜。令人惊讶的是,当n>3时,存在唯一的纯策略纳什均衡。唯一的纳什均衡是每位玩家都投掷标准的n面骰子,每个面有不同的数字。我们的证明唯一性是构造性的。我们介绍了一种算法,对于任何非标准骰子,我们都可以生成另一个能击败它的骰子。
英文摘要:
We consider a two player simultaneous-move game where the two players each select any permissible $n$-sided die for a fixed integer $n$. A player wins if the outcome of his roll is greater than that of his opponent. Remarkably, for $n>3$, there is a unique Nash Equilibrium in pure strategies. The unique Nash Equilibrium is for each player to throw the Standard $n$-sided die, where each side has a different number. Our proof of uniqueness is constructive. We introduce an algorithm with which, for any nonstandard die, we may generate another die that beats it.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。