PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

A distributed voting scheme to maximize preferences
Peter Auer and Nicolò Cesa-Bianchi
RAIRO - Theoretical Informatics and Applications Volume 40, pp. 389-403, 2006.


We study the problem of designing a distributed voting scheme for electing a candidate that maximizes the preferences of a set of agents. We assume the preference of agent i for candidate j is a real number x_i,j , and we do not make any assumptions on the mechanism generating these preferences. We show simple randomized voting schemes guaranteeing the election of a candidate whose expected total preference is nearly the highest among all candidates. The algorithms we consider are designed so that each agent has to disclose only a few bits of information from his preference table. Finally, in the important special case in which each agent is forced to vote for at most one candidate we show that our voting scheme is essentially optimal.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:2883
Deposited By:Peter Auer
Deposited On:23 November 2006