Pongrácz, András (2018) Discordant voting protocols for cyclically linked agents. In: International Conference of Computer Science and Engineering, 2018. 07. 04-06., London.
|
Text
WCE2018_pp165-168.pdf - Published Version Download (872kB) | Preview |
Abstract
Voting protocols, such as the push and the pull protocol, are designed to model the behavior of people during an election, but they have other applications. These processes have been studied in many areas, including but not limited to social models of interaction, distributed computing in peer-to-peer networks, and to describe how viruses or rumors spread in a community. In this paper we study the runtime of discordant linear protocols on the cycle graph, and the probability for each consensus to win in the end.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet |
| Depositing User: | Dr. András Pongrácz |
| Date Deposited: | 25 Sep 2018 07:51 |
| Last Modified: | 05 Apr 2023 07:43 |
| URI: | http://real.mtak.hu/id/eprint/85192 |
Actions (login required)
 |
Edit Item |
