|
|||||
 |
|
|
|
|
|
|
|
Properties of
sets of nontransitive dice with few sides
Levi Angel and Matt Davis
Vol. 11 (2018), No. 4, 643–659
|
Abstract |
|
We define and investigate several properties that sets of nontransitive dice might have. We prove several implications between these properties, which hold in general or for dice with few sides. We also investigate some algorithms for creating sets of 3-sided dice that realize certain tournaments. |
PDF Access Denied
We have not been able to recognize your IP address
3.238.111.130
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form. Or, visit our subscription page for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for USD 30.00:
Keywords
nontransitive dice, probability, tournaments
|
Mathematical Subject Classification 2010
Primary: 05B30
Secondary: 60C05
|
Milestones
Received: 15 December 2016
Revised: 22 May 2017
Accepted: 14 August 2017
Published: 15 January 2018
Communicated by Kenneth S. Berenhaut
|
Authors |
| Levi Angel | |
| Department of Mathematics and
Computer Science Muskingum University New Concord, OH United States |
|
| Matt Davis | |
| Department of Mathematics and
Computer Science Muskingum University New Concord, OH United States |
|
