most citedOn Approximating Optimal Weighted Lobbying, and Frequency of Correctness versus Average-Case Polynomial Time

8 citations · 15 across the 2 of their papers we have counts for

collaborators
Showing cs.GTShow all

1 paper · 1 filter

cs.GT2007★ 8 cited

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…