Fast leader-election protocols with bounded cheaters' edge

DOI10.1145/1132516.1132544zbMath1301.68051OpenAlexW1984892826MaRDI QIDQ2931383

Spyridon Antonakopoulos

Publication date: 25 November 2014

Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1132516.1132544

zbMATH Keywords

distributed computingleader electioncoin-flipping

Mathematics Subject Classification ID

Applications of game theory (91A80) (n)-person games, (n>2) (91A06) Distributed systems (68M14) Network protocols (68M12)

Related Items (2)

Optimal Impartial Selection ⋮ Rationality in the Full-Information Model

This page was built for publication: Fast leader-election protocols with bounded cheaters' edge