Winner determination in sequential majority voting (2007)

by J. Lang , M. S. Pini , F. Rossi , K. B. Venable , T. Walsh
Venue:In Proceedings of the ECAI-2006 Multidisciplinary Workshop on Advances in Preference Handling
Citations:38 - 12 self

Documents Related by Co-Citation

72 Voting procedures with incomplete preferences – Kathrin Konczak - 2005
37 Incompleteness and Incomparability in Preference Aggregation – M. S. Pini, F. Rossi, K. B. Venable, T. Walsh - 2007
124 When are elections with few candidates hard to manipulate – V Conitzer, T Sandholm, J Lang
48 Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders – Lirong Xia
40 Uncertainty in preference elicitation and aggregation – Toby Walsh
140 The computational difficulty of manipulating an election – J Bartholdi, C A Tovey, M A Trick - 1989
74 Vote Elicitation: Complexity and Strategy-Proofness – Vincent Conitzer, Tuomas Sandholm - 2002
17 Complexity of Terminating Preference Elicitation – Toby Walsh
43 Complexity of unweighted coalitional manipulation under . . . – Lirong Xia, Vincent Conitzer, Ariel D. Procaccia, Jeffrey S. Rosenschein
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
36 Copeland voting: Ties matter – Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor - 2008
353 Strategy-proofness and Arrow’s conditions: Existence and correspondence theorems for voting procedures and social welfare functions – M Satterthwaite - 1975
141 Single transferable vote resists strategic voting – John J. Bartholdi, III, James B. Orlin - 2003
57 The computational difficulty of manipulating an election.” Social Choice and Welfare 6 – J J Bartholdi, C A Tovey, M A Trick - 1989
29 A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes – Nadja Betzler, Susanne Hemmann, Rolf Niedermeier
9 A New Perspective on Implementation by Voting Trees – Felix Fischer, Ariel D. Procaccia, Alex Samorodnitsky
44 A short introduction to computational social choice – Yann Chevaleyre, Ulle Endriss, Jérôme Lang, Nicolas Maudet - 2007
26 The Computational Complexity of Choice Sets – Felix Brandt, Felix Fischer, Paul Harrenstein
59 Tournament Solutions and Majority Voting – J-F Laslier - 1997