35 citations · 200 across the 47 of their papers we have counts for
3 papers · 1 filter
Copeland Voting Fully Resists Constructive Control
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra +1
Control and bribery are settings in which an external agent seeks to influence the outcome of an election. Faliszewski et al. [FHHR07] proved that Llull voting (which is here denot…
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
Dorothea Baumeister, Joerg Rothe
Holzer and Holzer (Discrete Applied Mathematics 144(3):345--358, 2004) proved that the Tantrix(TM) rotation puzzle problem with four colors is NP-complete, and they showed that the…
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness versus Average-Case Polynomial Time
Gabor Erdelyi, Lane A. Hemaspaandra, Joerg Rothe +1
We investigate issues related to two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chri…