Coin-Flipping Games Immune against Linear-Sized Coalitions

DOI10.1137/0222030zbMATH Open0765.68043OpenAlexW2115000186MaRDI QIDQ4032947FDOQ4032947

Authors: Noga Alon, Moni Naor 

Publication date: 17 May 1993

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0222030

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

zbMATH Keywords

distributed computingfault toleranceperfect informationcoin-flippingleader-election games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Game theory (91A99) Combinatorial aspects of finite geometries (05B25)

Cited In (21)

• A lower bound for adaptively-secure collective coin flipping protocols
• An almost-optimally fair three-party coin-flipping protocol
• The influence of large coalitions
• On the Influence of Single Participant in Coin Flipping Schemes
• Fast perfect-information leader-election protocols with linear immunity
• A Robust Noncryptographic Protocol for Collective Coin Flipping
• A random hierarchical lattice: the series-parallel graph and its properties
• Rationality in the Full-Information Model
• An optimally fair coin toss
• Lower bounds for leader election and collective coin-flipping in the perfect information model
• Title not available (Why is that?)
• Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
• From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader
• High entropy random selection protocols
• Heads up: no teamwork required
• Biased random walks
• A lower bound for adaptively-secure collective coin-flipping protocols
• Perfect information leader election in \(\log^*n+O(1)\) rounds
• Optimal impartial selection
• \(\log^\ast\)-round game-theoretically-fair leader election
• Title not available (Why is that?)

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)