RAIRO-Theor. Inf. Appl.
Volume 40, Number 2, April-June 2006Alberto Bertoni: Climbing summits
|Page(s)||389 - 403|
|Published online||20 July 2006|
A distributed voting scheme to maximize preferences
Dept. of Mathematics and Information Technologies, University of Leoben, Austria.
2 Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Italy; email@example.com
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 xi,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.
Mathematics Subject Classification: 68W15 / 91B12
© EDP Sciences, 2006
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.