Leader Election Requires Logarithmic Time in Population Protocols

06/25/2019

∙

by   Yuichi Sudo, et al.

∙

0

∙

share

In this paper, it is shown that any leader election problem requires logarithmic stabilization time in the population protocol model. This lower bound holds even if each agent has knowledge of the exact size of a population and we can use arbitrarily large number of agent states. This lower bound concludes that the protocol given in [Sudo et al., PODC 2019] is optimal in terms of stabilization time.