 The truncated geometric election algorithm: Duration of the electionGuy Louchard and Mark Daniel Ward Statistics & Probability Letters, 2015, vol. 101, issue C, 40-48 Abstract: The present paper makes three distinct improvements over an earlier investigation of Kalpathy and Ward. We analyze the length of the entire election process (not just one participant’s duration), for a randomized election algorithm, with a truncated geometric number of survivors in each round. We not only analyze the mean and variance; we analyze the asymptotic distribution of the entire election process. We also introduce a new variant of the election that guarantees a unique winner will be chosen; this methodology should be more useful in practice than the previous methodology. The method of analysis includes a precise analytic (complex-valued) approach, relying on singularity analysis of probability generating functions. Keywords: Analysis of algorithms; Asymptotic analysis; Leader election; Generating function; Recurrence (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:101:y:2015:i:c:p:40-48 Ordering information: This journal article can be ordered from DOI: 10.1016/j.spl.2015.02.018 Access Statistics for this article Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul More articles in Statistics & Probability Letters from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.