---
res:
  bibo_abstract:
  - "This paper revisits a fundamental distributed computing problem in the population
    protocol model. Provided n agents each starting with an input color in [k], the
    relative majority problem asks to find the predominant color. In the population
    protocol model, at each time step, a scheduler selects two agents that first learn
    each other's states and then update their states based on what they learned.\r\nWe
    present the Circles protocol that solves the relative majority problem with k3
    states. It is always-correct under weakly fair scheduling. Not only does it improve
    upon the best known upper bound of O(k7), but it also shows a strikingly simpler
    design inspired by energy minimization in chemical settings.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Tom-Lukas
      foaf_name: Breitkopf, Tom-Lukas
      foaf_surname: Breitkopf
  - foaf_Person:
      foaf_givenName: Julien
      foaf_name: Dallot, Julien
      foaf_surname: Dallot
  - foaf_Person:
      foaf_givenName: Antoine
      foaf_name: El-Hayek, Antoine
      foaf_surname: El-Hayek
      foaf_workInfoHomepage: http://www.librecat.org/personId=888a098e-fcac-11ee-aff7-d347be57b725
    orcid: 0000-0003-4268-7368
  - foaf_Person:
      foaf_givenName: Stefan
      foaf_name: Schmid, Stefan
      foaf_surname: Schmid
  bibo_doi: 10.1145/3732772.3733512
  dct_date: 2025^xs_gYear
  dct_identifier:
  - UT:001525534800069
  dct_isPartOf:
  - http://id.crossref.org/issn/9798400718854
  dct_language: eng
  dct_publisher: Association for Computing Machinery@
  dct_title: 'Brief announcement: Minimizing energy solves relative majority with
    a cubic number of states in population protocols@'
...