  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.
