Work

Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols

Year: 2025

Type: conference-paper

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.

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3732772.3733512

Authors: Tom-Lukas Breitkopf, Julien Dallot, Antoine El-Hayek, Stefan Schmid

Institutions: Technische Universität Berlin, Institute of Science and Technology Austria

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funders: European Commission, Deutsche Forschungsgemeinschaft, Austrian Science Fund, European Research Council