13 citations · 34 across the 4 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2013
Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting
Piotr Faliszewski, Yannick Reisch, Jörg Rothe +1
A central theme in computational social choice is to study the extent to which voting systems computationally resist manipulative attacks seeking to influence the outcome of electi…
cs.GT2012★ 10 cited
Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach
Joerg Rothe, Lena Schend
Walsh [Wal10, Wal09], Davies et al. [DKNW10, DKNW11], and Narodytska et al. [NWX11] studied various voting systems empirically and showed that they can often be manipulated effecti…