Fast leader-election protocols with bounded cheaters' edge

DOI10.1145/1132516.1132544MaRDI QIDQ2931383zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Perfect information leader election in \(\log^*n+O(1)\) rounds
• Distributed protocols for leader election: a game-theoretic perspective
• Fast perfect-information leader-election protocols with linear immunity
• Game-theoretic fairness meets multi-party protocols: the case of leader election
• Simple and efficient leader election in the full information model

Cited in

(3)

• Finding cut-offs in leaderless rendez-vous protocols is easy
• Optimal impartial selection
• Rationality in the Full-Information Model

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931383)