Ranking opinions with few states in population protocols Population protocols are a model of distributed computing where 𝑛 agents, each a simple finite-state machine, interact in pairs to solve a common task against a (adversarial) interaction scheduler. This model was intensively studied in recent years; in particular, the problem of relative majority received much attention: Each agent starts with an input opinion (or color) out of 𝑘 possibilities, and the goal is for each agent to eventually output the color with the largest support in the population. Before our work, the state complexity (the minimum number of states required per agent) was only known to be between Ω(𝑘 2 ) and𝑂(𝑘 7 ). Our main contribution is a population protocol that solves the relative majority problem with 𝑘 3 states. We achieve this result with a new protocol called Circles. While prior approaches in the literature relied on duels of agents to find the majority color — an approach that proved effective for the case with two colors — Circles partitions the agents into circular linked lists of decreasing sizes, with the property that no two agents with the same initial color lie in the same circle. We show that Circles always correctly computes the desired structure against the most adversarial of schedulers (weakly fair). We then show that a trivial extension of Circles solves the relative majority problem. We extend our protocol to handle various tie-breaking mechanisms or to support the case where the agents do not share a prior ordering of the colors. Finally, we show that a modification of Circles solves the ranking problem with 2 · 𝑘^4 states, where each agent must output the rank of its initial color in the population. 414 - 424 414 - 424 Association for Computing Machinery application/pdf