Dicey Games characterize optimal strategies and complexity for teams using pairwise or limited shared randomness, proving they can exceed 1/4 win probability in a 4-player matching-pennies game against an adversary.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GT 2representative citing papers
citing papers explorer
-
Dicey Games: Shared Sources of Randomness in Distributed Systems
Dicey Games characterize optimal strategies and complexity for teams using pairwise or limited shared randomness, proving they can exceed 1/4 win probability in a 4-player matching-pennies game against an adversary.
- On the Coordination of Value-Maximizing Bidders