Distributed protocols for leader election: a game-theoretic perspective

DOI10.1007/978-3-642-41527-2_5MaRDI QIDQ2920964zbMATH OpenOpenAlexFDO

Authors Ittai Abraham, Danny Dolev, Joseph Y. Halpern

Publication date 29 September 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-41527-2_5

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Applications of game theory (91A80)

Recommendations

• Fair leader election for rational agents in asynchronous rings and networks
• Game-theoretic fairness meets multi-party protocols: the case of leader election
• \(\log^\ast\)-round game-theoretically-fair leader election
• Short paper: On game-theoretically-fair leader election
• Perfect information leader election in \(\log^*n+O(1)\) rounds

Cited in

(13)

• Resolving distributed knowledge
• Reaching distributed equilibrium with limited ID space
• Game-theoretic fairness meets multi-party protocols: the case of leader election
• Optimal strategies for selecting coordinators
• scientific article; zbMATH DE number 1696668 (Why is no real title available?)
• Fast leader-election protocols with bounded cheaters' edge
• Perfectly secure message transmission against independent rational adversaries
• The role of a-priori information in networks of rational agents
• Equilibria of Games in Networks for Local Tasks
• Fair leader election for rational agents in asynchronous rings and networks
• Rational consensus (extended abstract)
• Short paper: On game-theoretically-fair leader election
• Cost distribution of the Chang-Roberts leader election algorithm and related problems

This page was built for publication: Distributed protocols for leader election: a game-theoretic perspective

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