A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
Population protocols model information spreading in networks where pairwise node exchanges are determined by an external random scheduler. Most of the population protocols in the literature assume that the participating n nodes are honest. Such an assumption may not be, however, accurate for large-scale systems of small devices. Hence, in this work, we study population protocols in a setting where up to f nodes can be Byzantine. We examine the majority (binary) consensus problem againstarXiv:2105.07123v2 fatcat:ylxmqzmsfzdzthe2vnx6tmj2v4