Voting protocols on the star graph (Q6548057)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7857970
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Voting protocols on the star graph |
scientific article; zbMATH DE number 7857970 |
Statements
Voting protocols on the star graph (English)
0 references
31 May 2024
0 references
The authors considered a finite graph together with an initial assignment, which represents the opinion of each vertex. The paper provides procedures for deriving asymptotically sharp results for the worst expected runtime. The results generated 3 lemmas and 2 theorems.
0 references
discordant voting
0 references
push
0 references
pull
0 references
star graph
0 references
0.7889442443847656
0 references
0.7816475033760071
0 references
0.7803635001182556
0 references
0.758851945400238
0 references
0.7498941421508789
0 references
