The Swedish Leader Election Protocol: Analysis and Variations

DOI10.1137/1.9781611973013.14zbMath1430.68019OpenAlexW2096848466MaRDI QIDQ5194698

Conrado Martínez, Prodinger, Helmut, Guy Louchard

Publication date: 16 September 2019

Published in: 2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (2)

Bivariate issues in leader election algorithms with Marshall-Olkin limit distribution ⋮ The asymmetric leader election algorithm: Number of survivors near the end of the game

This page was built for publication: The Swedish Leader Election Protocol: Analysis and Variations