Vol. 11, No. 4, 2018

Download this article
Download this article For screen
For printing
Recent Issues

Volume 17
Issue 5, 723–899
Issue 4, 543–722
Issue 3, 363–541
Issue 2, 183–362
Issue 1, 1–182

Volume 16, 5 issues

Volume 15, 5 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Editors' interests
 
Subscriptions
 
ISSN 1944-4184 (online)
ISSN 1944-4176 (print)
 
Author index
To appear
 
Other MSP journals
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.

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