Optimal algorithms for exact, inexact, and approval voting

The design of optimal n-way voting algorithms based on the structure of the input object space is considered. The design techniques are then extended to inexact and approval voting schemes. It is shown that efficient theta (n)-time voting algorithms can be designed when the input object space is sma...

Full description

Saved in:
Bibliographic Details
Published inFault-Tolerant Computing Symposium (FTCS-22) pp. 404 - 411
Main Author Parhami, B.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1992
Subjects
Algorithm design and analysis
Degradation
Extraterrestrial measurements
Frequency
Hardware
High performance computing
Redundancy
Software performance
Sorting
Voting
Online AccessGet full text
ISBN9780818628757
0818628758
DOI10.1109/FTCS.1992.243595

Cover

More Information
Summary:The design of optimal n-way voting algorithms based on the structure of the input object space is considered. The design techniques are then extended to inexact and approval voting schemes. It is shown that efficient theta (n)-time voting algorithms can be designed when the input object space is small. Next in the hierarchy is the case of a totally-ordered object space that supports worst-case theta (nlogn) algorithms for both exact and inexact voting as well as for certain approval-voting schemes. An unordered input object space leads to worst-case Omega (n/sup 2/) algorithms, even when a distance metric can be defined on the input object space. Some observations on the relationship of voting to other well-studied problems, particularly sorting, are also included.< >
ISBN:9780818628757
0818628758
DOI:10.1109/FTCS.1992.243595