Indexed metadata
General Constructions of Permutation-Fair Dice
Tomáš Gavenčiak, Bernhard Haeupler, Václav Rozhoň
Source abstract
Suppose that each of players rolls a different die and the players are ordered by their rolls. Can the dice use disjoint labels such that ties are impossible, while all orders remain equally likely? We give two general constructions of such dice and solve some related problems.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.