A distributed voting scheme to maximize preferences
Auer, Peter ; Cesa-Bianchi, Nicolò
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 40 (2006), p. 389-403 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)

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.

Publié le : 2006-01-01
DOI : https://doi.org/10.1051/ita:2006015
Classification:  68W15,  91B12 
@article{ITA_2006__40_2_389_0,
     author = {Auer, Peter and Cesa-Bianchi, Nicol\`o},
     title = {A distributed voting scheme to maximize preferences},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {40},
     year = {2006},
     pages = {389-403},
     doi = {10.1051/ita:2006015},
     mrnumber = {2252646},
     zbl = {1112.68133},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_2006__40_2_389_0}
}

Auer, Peter; Cesa-Bianchi, Nicolò. A distributed voting scheme to maximize preferences. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 40 (2006) pp. 389-403. doi : 10.1051/ita:2006015. http://gdmltest.u-ga.fr/item/ITA_2006__40_2_389_0/

[1] P. Auer, P. Caianiello and N. Cesa-Bianchi, Tight bounds on the cumulative profit of distributed voters, in Proceedings of the 15th ACM Symposium on Principles of Distributed Computing. ACM Press (1996) 312.

[2] P. Caianiello, P. Crescenzi and A. Marchetti-Spaccamela, Distributed voting and maximum satisfiability. Unpublished manuscript (1993).

[3] H.S. Chang, Multi-policy iteration with a distributed voting. Math. Methods Oper. Res. 60 (2004) 299-310. | Zbl 1076.90065

[4] H.S. Chang, On the probability of correct selection by distributed voting in stochastic optimization. J. Optim. Theory Appl. 125 (2005) 231-240. | Zbl 1097.91030

[5] Y.S. Chow and H. Teicher, Probability Theory. Springer (1988). | MR 953964 | Zbl 0652.60001

[6] X. Deng and C.H. Papadimitriou, Distributed decision-making with incomplete information, in Proceedings of the 12ft IFIP Congress. Madrid (1992).

[7] C. Dwork, R. Kumar, M. Naor and D. Sivakumar, Rank aggregation revisited, in Proceedings of the 10th International World Wide Web Conference (2001) 96-104.

[8] E. Ephrati and J.S. Rosenschein, Reaching agreement through partial revelation of preferences, in Proceedings of the 10th European Conference on Artificial Intelligence (1992) 229-233.

[9] C.H. Papadimitriou and M. Yannakakis, On the value of information in distributed decision making, in Proceedings of the 10th ACM Symposium on Principles of Distributed Computing. ACM Press (1991) 61-64.

[10] C.H. Papadimitriou and M. Yannakakis, Linear programming without the matrix, in Proceedings of the 25th ACM Symposium on the Theory of Computing. ACM Press (1993) 121-129.

[11] D. Pollard, Convergence of Stochastic Processes. Springer (1984). | MR 762984 | Zbl 0544.60045