Nonuniform vote aggregation algorithms

Farzad Farnoud, Behrouz Touri, Olgica Milenkovic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider the problem of non-uniform vote aggregation, and in particular, the algorithmic aspects associated with the aggregation process. For a novel class of weighted distance measures on votes, we present two different aggregation methods. The first algorithm is based on approximating the weighted distance measure by Spearman's footrule distance, with provable constant approximation guarantees. The second algorithm is based on a non-uniform Markov chain method inspired by PageRank, for which currently only heuristic guarantees are known. We illustrate the performance of the proposed algorithms on a number of distance measures for which the optimal solution may be easily computed.

Original languageEnglish (US)
Title of host publication2012 International Conference on Signal Processing and Communications, SPCOM 2012
DOIs
StatePublished - Oct 26 2012
Event2012 9th International Conference on Signal Processing and Communications, SPCOM 2012 - Bangalore, India
Duration: Jul 22 2012Jul 25 2012

Publication series

Name2012 International Conference on Signal Processing and Communications, SPCOM 2012

Other

Other2012 9th International Conference on Signal Processing and Communications, SPCOM 2012
CountryIndia
CityBangalore
Period7/22/127/25/12

ASJC Scopus subject areas

  • Signal Processing
  • Communication

Fingerprint Dive into the research topics of 'Nonuniform vote aggregation algorithms'. Together they form a unique fingerprint.

  • Cite this

    Farnoud, F., Touri, B., & Milenkovic, O. (2012). Nonuniform vote aggregation algorithms. In 2012 International Conference on Signal Processing and Communications, SPCOM 2012 [6290238] (2012 International Conference on Signal Processing and Communications, SPCOM 2012). https://doi.org/10.1109/SPCOM.2012.6290238