We study population protocols, a model of distributed computing appropriate for modeling
well-mixed chemical reaction networks and other physical systems where agents exchange …

The model of population protocols refers to the growing in popularity theoretical framework
suitable for studying pairwise interactions within a large collection of simple …

We consider the plurality consensus problem for population protocols. Here, n anonymous
agents start each with one of k opinions. Their goal is to agree on the initially most frequent …

The population protocol model describes a network of n anonymous agents who cannot
control with whom they interact. The agents collectively solve a computational problem …

We analyze the convergence of the k-opinion Undecided State Dynamics (USD) in the
population protocol model. For k= 2 opinions it is well known that the USD reaches …

We consider the problem of efficiently simulating population protocols. In the population
model, we are given a distributed system of $ n $ agents modeled as identical finite-state …

We present a loosely-stabilizing phase clock for population protocols. In the population
model we are given a system of $ n $ identical agents which interact in a sequence of …

We consider the plurality consensus problem for n agents. Initially, each agent has one of k
opinions. Agents choose random interaction partners and revise their state according to a …

The population protocol model describes a network of anonymous agents that interact
asynchronously in pairs chosen at random. Each agent starts in the same initial state $ s …

Computing via synthetically engineered bacteria is a vibrant and active field with numerous
applications in bio-production, bio-sensing, and medicine. Motivated by the lack of …