Abstract
Summary. We consider a two-player, simultaneous-move game where each player selects any permissible n-sided die for a fixed integer n. For any n > 3, there is a unique Nash equilibrium in pure strategies in which each player throws the standard n-sided die. Our proof of uniqueness is constructive, and we introduce an algorithm with which, for any nonstandard die, we can generate another die that beats it. For any nonstandard die there exists a one-step die—a die that is obtained by transferring one dot from one side to another on the standard die—that beats it.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
