Coin-Flipping Games Immune against Linear-Sized Coalitions

DOI10.1137/0222030zbMath0765.68043OpenAlexW2115000186MaRDI QIDQ4032947

Moni Naor, Noga Alon

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

zbMATH Keywords

fault tolerancedistributed computingperfect informationcoin-flippingleader-election games

Mathematics Subject Classification ID

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

Related Items (max. 100)

A lower bound for adaptively-secure collective coin flipping protocols ⋮ Optimal Impartial Selection ⋮ An optimally fair coin toss ⋮ Fast perfect-information leader-election protocols with linear immunity ⋮ Biased random walks ⋮ High entropy random selection protocols ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ The influence of large coalitions ⋮ A random hierarchical lattice: the series-parallel graph and its properties ⋮ A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols ⋮ Rationality in the Full-Information Model ⋮ Perfect information leader election in \(\log^*n+O(1)\) rounds

This page was built for publication: Coin-Flipping Games Immune against Linear-Sized Coalitions