A distributed voting scheme to maximize preferences

Peter Auer; Nicolò Cesa-Bianchi

RAIRO - Theoretical Informatics and Applications (2006)

  • Volume: 40, Issue: 2, page 389-403
  • ISSN: 0988-3754

Abstract

top
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.

How to cite

top

Auer, Peter, and Cesa-Bianchi, Nicolò. "A distributed voting scheme to maximize preferences." RAIRO - Theoretical Informatics and Applications 40.2 (2006): 389-403. <http://eudml.org/doc/249623>.

@article{Auer2006,
abstract = { 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. },
author = {Auer, Peter, Cesa-Bianchi, Nicolò},
journal = {RAIRO - Theoretical Informatics and Applications},
language = {eng},
month = {7},
number = {2},
pages = {389-403},
publisher = {EDP Sciences},
title = {A distributed voting scheme to maximize preferences},
url = {http://eudml.org/doc/249623},
volume = {40},
year = {2006},
}

TY - JOUR
AU - Auer, Peter
AU - Cesa-Bianchi, Nicolò
TI - A distributed voting scheme to maximize preferences
JO - RAIRO - Theoretical Informatics and Applications
DA - 2006/7//
PB - EDP Sciences
VL - 40
IS - 2
SP - 389
EP - 403
AB - 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.
LA - eng
UR - http://eudml.org/doc/249623
ER -

References

top
  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.  
  4. H.S. Chang, On the probability of correct selection by distributed voting in stochastic optimization. J. Optim. Theory Appl.125 (2005) 231–240.  
  5. Y.S. Chow and H. Teicher, Probability Theory. Springer (1988).  
  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).  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.