An Empirical Study of the Manipulability of Single Transferable Voting

28 May 2010

Papers citing "An Empirical Study of the Manipulability of Single Transferable Voting"

13 / 13 papers shown

Title
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice P. Dey 43 1 0 23 Mar 2017
Complexity of Manipulation with Partial Information in Voting P. Dey Neeldhara Misra Y. Narahari 59 27 0 15 Apr 2016
Allocation in Practice T. Walsh 76 18 0 11 Jul 2014
The Computational Impact of Partial Votes on Strategic Voting Nina Narodytska T. Walsh 83 50 0 28 May 2014
Detecting Possible Manipulators in Elections P. Dey Neeldhara Misra Y. Narahari 63 9 0 09 Apr 2014
How Hard Is It to Control an Election by Breaking Ties? Nicholas Mattei Nina Narodytska T. Walsh 97 201 0 23 Apr 2013
Manipulation of Nanson's and Baldwin's Rules Nina Narodytska T. Walsh Lirong Xia 78 32 0 27 Jun 2011
Complexity of and Algorithms for Borda Manipulation Jessica Davies G. Katsirelos Nina Narodytska T. Walsh 82 99 0 27 May 2011
Control Complexity in Bucklin and Fallback Voting G. Erdélyi M. Fellows J. Rothe Lena Schend 173 17 0 11 Mar 2011
Where are the hard manipulation problems? T. Walsh 121 72 0 29 Jul 2010
An Empirical Study of Borda Manipulation Jessica Davies G. Katsirelos Nina Narodytska T. Walsh 92 15 0 29 Jul 2010
Is Computational Complexity a Barrier to Manipulation? T. Walsh 125 29 0 05 Jul 2010
The Complexity of Manipulating $k$ -Approval Elections Andrew Lin 139 44 0 23 May 2010