Lune

AAAI2022Top-tier venue

Is There a Strongest Die in a Set of Dice with the Same Mean Pips?

Shang Lu, Shuji Kijima

Abstract

Jan-ken, a.k.a. rock-paper-scissors, is a cerebrated example of a non-transitive game with three (pure) strategies, rock, paper and scissors. Interestingly, any Jan-ken generalized to four strategies contains at least one useless strategy unless it allows a tie between distinct pure strategies. Non-transitive dice could be a stochastic analogue of Jan-ken: the stochastic transitivity does not hold on some sets of dice, e.g., Efron's dice. Including the non-transitive dice, this paper is involved in dice sets which do not contain some useless dice. In particular, we are concerned with the existence of a strongest (or weakest, symmetrically) die in a dice set under the two conditions that (1) any number appears on at most one die and at most one side, i.e., no tie break between two distinct dice, and (2) the mean pips of dice are the same. We firstly prove that a strongest die never exist if a set of n dice of m-sided is given as a partition of the set of numbers 1, . . . , mn. Next, we show some sufficient conditions that the strongest die exists in a dice set which is not a partition of a set of numbers. We also give some algorithms to find the strongest die in a dice set which includes given dice.

Ask Lune

Know this paper in minutes, not an afternoon.

Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.

Questions to start from

Lune can draw on

the full paper · related work

Get the answer

Free to start. No credit card required.

Related papers

  1. Dicey Games: Shared Sources of Randomness in Distributed SystemsLéonard Brice, Thomas A. Henzinger, K. S. ThejaswiniLICS 2026
  2. Best-Effort Policies for Robust Markov Decision ProcessesAlessandro Abate, Thom Badings, Giuseppe De Giacomo, Francesco FabianoAAAI 2026
  3. Ranking with Multiple Oracles: From Weak to Strong Stochastic TransitivityTao Jin, Yue Wu, Quanquan Gu, Farzad FarnoudICML 2025
  4. The Sample Complexity of Best-k Items Selection from Pairwise ComparisonsWenbo Ren, Jia Liu, Ness B. ShroffICML 2020 · 14 citations
  5. Choosing Answers in Epsilon-Best-Answer Identification for Linear BanditsMarc Jourdan, Rémy DegenneICML 2022 · 4 citations
Dusk over the sea between two cliffs drawn in fine vertical lines