Discordant voting protocols for cyclically linked agents
The electronic journal of combinatorics, Tome 27 (2020) no. 1
Voting protocols, such as the push and the pull protocol, model the behavior of people during an election. These processes have been studied in distributed computing in peer-to-peer networks, and to describe how viruses or rumors spread in a community. We determine the asymptotic behavior of the runtime of discordant linear protocols on the cycle graph and the probability for each consensus to win.
DOI :
10.37236/8578
Classification :
91B12
Mots-clés : voting protocols, election, winning probabilities
Mots-clés : voting protocols, election, winning probabilities
Affiliations des auteurs :
András Pongrácz  1
@article{10_37236_8578,
author = {Andr\'as Pongr\'acz},
title = {Discordant voting protocols for cyclically linked agents},
journal = {The electronic journal of combinatorics},
year = {2020},
volume = {27},
number = {1},
doi = {10.37236/8578},
zbl = {1435.91081},
url = {http://geodesic.mathdoc.fr/articles/10.37236/8578/}
}
András Pongrácz. Discordant voting protocols for cyclically linked agents. The electronic journal of combinatorics, Tome 27 (2020) no. 1. doi: 10.37236/8578
Cité par Sources :