Coin-Flipping Games Immune against Linear-Sized Coalitions
From MaRDI portal
Publication:4032947
Recommendations
- Lower bounds for leader election and collective coin-flipping in the perfect information model
- Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
- The influence of large coalitions
- Adaptively secure coin-flipping, revisited
- scientific article; zbMATH DE number 4106654
Cited in
(20)- Optimal impartial selection
- On the Influence of Single Participant in Coin Flipping Schemes
- Biased random walks
- Rationality in the Full-Information Model
- High entropy random selection protocols
- Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
- scientific article; zbMATH DE number 4106654 (Why is no real title available?)
- A lower bound for adaptively-secure collective coin flipping protocols
- A random hierarchical lattice: the series-parallel graph and its properties
- Heads up: no teamwork required
- The influence of large coalitions
- From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader
- \(\log^\ast\)-round game-theoretically-fair leader election
- An optimally fair coin toss
- A Robust Noncryptographic Protocol for Collective Coin Flipping
- A lower bound for adaptively-secure collective coin-flipping protocols
- Lower bounds for leader election and collective coin-flipping in the perfect information model
- Fast perfect-information leader-election protocols with linear immunity
- scientific article; zbMATH DE number 4138842 (Why is no real title available?)
- Perfect information leader election in \(\log^*n+O(1)\) rounds
This page was built for publication: Coin-Flipping Games Immune against Linear-Sized Coalitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032947)
