Game-theoretically fair distributed sampling
From MaRDI portal
Publication:6653028
DOI10.1007/978-3-031-68397-8_7MaRDI QIDQ6653028
K. Wu, Pratik Soni, Sri Aravinda Krishnan Thyagarajan
Publication date: 13 December 2024
Could not fetch data.
Cites Work
- An optimally fair coin toss
- Perfect information leader election in \(\log^*n+O(1)\) rounds
- Game theoretic notions of fairness in multi-party coin toss
- Game-theoretic fairness meets multi-party protocols: the case of leader election
- A complete characterization of game-theoretically fair, multi-party coin toss
- Protocols for multiparty coin toss with a dishonest majority
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
- Coin flipping by telephone a protocol for solving impossible problems
- Coin Flipping of Any Constant Bias Implies One-Way Functions
- Fair Coin Flipping: Tighter Analysis and the Many-Party Case
- Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling
- Coin Flipping with Constant Bias Implies One-Way Functions
- \(\log^\ast\)-round game-theoretically-fair leader election
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)
