A Game of Nontransitive Dice

Artem Hulko and Mark Whitmeyer

Papers from arXiv.org

Abstract: 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.

Date: 2017-06, Revised 2018-10
New Economics Papers: this item is included in nep-gth and nep-mic
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/1706.00849 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1706.00849

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().