The Power of Two Choices in Distributed Voting

DOI10.1007/978-3-662-43951-7_37zbMath1409.68040arXiv1404.7479OpenAlexW283401411MaRDI QIDQ5167858

Robert Elsässer, Tomasz Radzik, Colin Cooper

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.7479

Mathematics Subject Classification ID

Games involving graphs (91A43) Voting theory (91B12) Distributed systems (68M14)

Related Items (13)

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols ⋮ On convergence and threshold properties of discrete Lotka-Volterra population protocols ⋮ Voter and majority dynamics with biased and stubborn agents ⋮ Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models ⋮ On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting? ⋮ Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication ⋮ Phase transition of the \(k\)-majority dynamics in biased communication models ⋮ Unnamed Item ⋮ Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model ⋮ Distributed Averaging in Opinion Dynamics ⋮ Brief Announcement: Discrete Incremental Voting ⋮ Phase transition of the 2-choices dynamics on core-periphery networks ⋮ Noisy rumor spreading and plurality consensus

This page was built for publication: The Power of Two Choices in Distributed Voting