The truncated geometric election algorithm: duration of the election

DOI10.1016/J.SPL.2015.02.018MaRDI QIDQ893906zbMATH OpenOpenAlexFDO

Authors Mark Daniel Ward, Guy Louchard

Publication date 23 November 2015

Published in Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.spl.2015.02.018

zbMATH Keywords

generating functionasymptotic analysisleader electionrecurrencerandomized leader election algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial probability (60C05) Voting theory (91B12)

Recommendations

• On a leader election algorithm: truncated geometric case study
• Leader election: a Markov chain approach
• On the distribution for the duration of a randomized leader election algorithm
• Locally guided randomized elections in trees: The totally fair case
• Analysis of an asymmetric leader election algorithm

Cites work

• Analytic combinatorics
• Asymptotic analysis of a leader election algorithm
• On a leader election algorithm: truncated geometric case study
• The asymmetric leader election algorithm: another approach

Cited in

(3)

• Modelling the influence of returns for an omni-channel retailer
• On distribution of the leadership time in counting votes and predicting winners
• On a leader election algorithm: truncated geometric case study

This page was built for publication: The truncated geometric election algorithm: duration of the election

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