Analysis of Distributed Algorithms and Processes in the Population Protocol Model

Population protocols have been introduced by Angluin et al. as a simple, but powerful computingmodel to solve certain fundamental problems in distributed computing. In the original model a system consisting of n anonymous agents is given and a scheduler selects, in discrete time steps, a pair of agentsfor an interaction. The interacting agents exchange their states and execute a so-called state transition, as specified by the population protocol. In this project the goal is to design efficient population protocols for fundamental problems such as leader election, plurality consensus or population control.