arXiv (All)
open access
General Constructions of Permutation-Fair Dice
Suppose that each of $n$ 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 $n!$ orders remain equally likely? We give two general constructions of such dice and solve some related problems.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Permutation-invariant social welfare orders are anonymous#103343
- A Risky Problem for Permutation Invariance#100889
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1109623
- Aggregation for potentially infinite populations without continuity or completeness#752019
- Preference-based Cooperation in a Prisoner's Dilemma Game#1276739
Record · ID 1326671
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive