scholarly journals Loosely Stabilizing Leader Election on Arbitrary Graphs in Population Protocols without Identifiers or Random Numbers

2020 ◽  
Vol E103.D (3) ◽  
pp. 489-499 ◽  
Author(s):  
Yuichi SUDO ◽  
Fukuhito OOSHITA ◽  
Hirotsugu KAKUGAWA ◽  
Toshimitsu MASUZAWA
Author(s):  
Janna Burman ◽  
Ho-Lin Chen ◽  
Hsueh-Ping Chen ◽  
David Doty ◽  
Thomas Nowak ◽  
...  

2021 ◽  
Vol 68 (1) ◽  
pp. 1-21
Author(s):  
Leszek Gąsieniec ◽  
Grzegorz Stachowiak

2016 ◽  
Vol 31 (4) ◽  
pp. 257-271 ◽  
Author(s):  
David Doty ◽  
David Soloveichik

2020 ◽  
Vol 30 (01) ◽  
pp. 2050005 ◽  
Author(s):  
Yuichi Sudo ◽  
Toshimitsu Masuzawa

This paper shows that every leader election protocol requires logarithmic stabilization time both in expectation and with high probability in the population protocol model. This lower bound holds even if each agent has knowledge of the exact size of a population and is allowed to use an arbitrarily large number of agent states. This lower bound concludes that the protocol given in [Sudo et al., SSS 2019] is time-optimal in expectation.


Author(s):  
Shantanu Das ◽  
Giuseppe Antonio Di Luna ◽  
Paola Flocchini ◽  
Nicola Santoro ◽  
Giovanni Viglietta

Sign in / Sign up

Export Citation Format

Share Document