Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Distributed Computing manuscript No. (will be inserted by the editor)
 

Summary: Distributed Computing manuscript No.
(will be inserted by the editor)
Dana Angluin James Aspnes David Eisenstat
A Simple Population Protocol for Fast Robust
Approximate Majority
Received: date / Accepted: date
Abstract We describe and analyze a 3-state one-way
population protocol to compute approximate majority
in the model in which pairs of agents are drawn uni-
formly at random to interact. Given an initial configu-
ration of x's, y's and blanks that contains at least one
non-blank, the goal is for the agents to reach consen-
sus on one of the values x or y. Additionally, the value
chosen should be the majority non-blank initial value,
provided it exceeds the minority by a sufficient margin.
We prove that with high probability n agents reach con-
sensus in O(n log n) interactions and the value chosen is
the majority provided that its initial margin is at least
(

  

Source: Aspnes, James - Department of Computer Science, Yale University

 

Collections: Computer Technologies and Information Sciences