We consider the fundamental problem of assigning distinct labels to agents in the probabilistic model of population protocols. Our protocols operate under the assumption that the size $n$ of the population is embedded in the transition function. Our labeling protocols are silent, i.e., eventually each agent reaches its final state and remains in it forever, as well as safe, i.e., never update the label assigned to any single agent. We first present a fast, silent and safe labeling protocol for which the required number of interactions is asymptotically optimal, i.e., $O(n \log n/\epsilon)$ w.h.p. It uses $(2+\epsilon)n+O(n^c)$ states, for any $c<1,$ and the label range $1,\dots,(1+\epsilon)n.$ Furthermore, we consider the so-called pool labeling protocols that include our fast protocol. We show that the expected number of interactions required by any pool protocol is $\ge \frac{n^2}{r+1}$, when the labels range is $1,\dots, n+r<2n.$ Next, we provide a silent and safe protocol which uses only $n+5\sqrt n +O(n^c)$ states, for any $c<1,$ and draws labels from the range $1,\dots,n.$ The expected number of interactions required by the protocol is $O(n^3).$ On the other hand, we show that any silent protocol that produces a valid labeling and is safe with probability $>1-\frac 1n$, uses $\ge n+\sqrt {n-1} -1$ states. Hence, our protocol is almost state-optimal. We also present a generalization of the protocol to include a trade-off between the number of states and the expected number of interactions. Furthermore, we show that for any silent and safe labeling protocol utilizing $n+t<2n$ states the expected number of interactions required to achieve a valid labeling is $\ge \frac{n^2}{t+1}$.

翻译：我们考虑在人口协议的概率模式中为代理商分配不同标签的根本问题。 我们的协议运行的假设是, 人口规模$的美元将嵌入过渡功能中。 我们的标签协议是静态的, 也就是说, 最终每个代理商将达到最终状态, 并且永远留在其中, 并且安全, 也就是说, 永远不更新分配给任何单一代理商的标签。 我们首先展示一个快速、 静态和安全的标签协议, 其所需的互动数量是非同步的, 即: $( n) n( n) n/ epslon) $ ( w.h. p.) 。 它使用$( 2) eepslon) n(n) +n(n) 美元) (n(n) 美元) (c) (n) (n) i(n) (n) (n) (n) (n) (n) (n) (n) (n) (n) (c) (c) (n(n) (c) (n) (c) (c) (c) (c) (c) (d) (t) (t) (t) disp(t) (t) (t) (t) (t) (t(t) (t) (t(t) (t) (t) (t(t) (t) (t) (t) (t) (l) (t) (t(t) (t) (t) (t) (t) (t(t) (t) (t(t) (t) (t) (t(t) (t) (t(t) (t) (t(t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t(t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t) (t(t) (t) (t) (t) (t)