A new look at egocentric algorithms

With respect to approximate agreement, some categories of voting algorithms have been developed. This research presents an approach to one family of algorithms called egocentric algorithms, and analyzes the conditions under which the approach performs better than the existing egocentric voting algor...

Full description

Saved in:
Bibliographic Details
Main Authors: Azadmanesh, A.H., Sharif, H.
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Applied sciences
Clocks
Computer science
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Convergence
Delay
Electronic voting
Exact sciences and technology
Performance analysis
Sampling methods
Sensor systems and applications
Software
Synchronization
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With respect to approximate agreement, some categories of voting algorithms have been developed. This research presents an approach to one family of algorithms called egocentric algorithms, and analyzes the conditions under which the approach performs better than the existing egocentric voting algorithms. In addition, the approach provides some insight into the voting process of such algorithms.
ISSN:1521-9097
2690-5965
DOI:10.1109/ICPADS.2004.1316112