Discordant voting protocols for cyclically linked agents

DOI10.37236/8578zbMath1435.91081OpenAlexW3011570367MaRDI QIDQ2309228

András Pongrácz

Publication date: 30 March 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i1p58

zbMATH Keywords

electionwinning probabilitiesvoting protocols

Mathematics Subject Classification ID

Voting theory (91B12)

Cites Work

• Unnamed Item
• Unnamed Item
• Mean field conditions for coalescing random walks
• Distributed probabilistic polling and applications to proportionate agreement
• Evolving voter model on dense random graphs
• On the Push&Pull Protocol for Rumour Spreading
• Finite particle systems and infection models
• Push-to-Pull Peer-to-Peer Live Streaming
• Constructive Proofs of Concentration Bounds
• A survey of gossiping and broadcasting in communication networks
• The Linear Voting Model
• Discordant Voting Processes on Finite Graphs
• Graph fission in an evolving voter model
• On the coalescence time of reversible random walks
• Coalescing Random Walks and Voting on Connected Graphs

This page was built for publication: Discordant voting protocols for cyclically linked agents