Author of the publication

Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates.

, , , and . J. Artif. Intell. Res., (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Copeland voting: ties matter., , and . AAMAS (2), page 983-990. IFAAMAS, (2008)The Complexity of Online Bribery in Sequential Elections., , and . CoRR, (2019)Complexity Dichotomies for Unweighted Scoring Rules., and . CoRR, (2016)Search versus Decision for Election Manipulation Problems., , and . STACS, volume 20 of LIPIcs, page 377-388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Dichotomy for voting systems., and . J. Comput. Syst. Sci., 73 (1): 73-83 (2007)Complexity of stability., , and . J. Comput. Syst. Sci., (2022)Complexity of Conformant Election Manipulation., and . FCT, volume 14292 of Lecture Notes in Computer Science, page 176-189. Springer, (2023)The Complexity of Bribery in Elections., , and . AAAI, page 641-646. AAAI Press, (2006)Modeling Single-Peakedness for Votes with Ties., and . STAIRS, volume 284 of Frontiers in Artificial Intelligence and Applications, page 63-74. IOS Press, (2016)The Complexity of Online Bribery in Sequential Elections (Extended Abstract)., , and . TARK, volume 297 of EPTCS, page 233-251. (2019)