Efficient assignment of identities in anonymous populations
We consider the fundamental problem of assigning distinct labels to agents in theprobabilistic model of population protocols. Our protocols operate under the assumptionthat the size n of the population is embedded in the transition function. W.h.p. (withhigh probability), they are silent, i.e., eventually each agent reaches its nal state andremains in it forever, and they are safe, i.e., never cha
