Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols

We study leader election problem via ranking within self-stabilising population protocols. In this scenario, the agent's state space comprises n rank states and x extra states. The initial configuration of n agents consists of arbitrary arrangements of rank and extra states, with the objective of self-ranking. Specifically, each agent is tasked with stabilising in a unique rank state silently, implying that after stabilisation, each agent remains in its designated state indefinitely.