Discordant voting protocols for cyclically linked agents
The electronic journal of combinatorics, Tome 27 (2020) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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

András Pongrácz  1

1 University of Debrecen, Department of Algebra and Number Theory
@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/}
}
TY  - JOUR
AU  - András Pongrácz
TI  - Discordant voting protocols for cyclically linked agents
JO  - The electronic journal of combinatorics
PY  - 2020
VL  - 27
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/8578/
DO  - 10.37236/8578
ID  - 10_37236_8578
ER  - 
%0 Journal Article
%A András Pongrácz
%T Discordant voting protocols for cyclically linked agents
%J The electronic journal of combinatorics
%D 2020
%V 27
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/8578/
%R 10.37236/8578
%F 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 :