Game-theoretically fair distributed sampling
From MaRDI portal
Recommendations
- A complete characterization of game-theoretically fair, multi-party coin toss
- Game theoretic notions of fairness in multi-party coin toss
- On fair exchange, fair coins and fair sampling
- \(\log^\ast\)-round game-theoretically-fair leader election
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
Cites work
- \(\log^\ast\)-round game-theoretically-fair leader election
- A complete characterization of game-theoretically fair, multi-party coin toss
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- An optimally fair coin toss
- Coin flipping by telephone a protocol for solving impossible problems
- Coin flipping of \textit{any} constant bias implies one-way functions
- Coin Flipping with Constant Bias Implies One-Way Functions
- Fair coin flipping: tighter analysis and the many-party case
- Game theoretic notions of fairness in multi-party coin toss
- Game-theoretic fairness meets multi-party protocols: the case of leader election
- Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Perfect information leader election in \(\log^*n+O(1)\) rounds
- Protocols for multiparty coin toss with a dishonest majority
- Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling
Cited in
(2)
This page was built for publication: Game-theoretically fair distributed sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653028)
