Beyond the Worst Case: Semi-Random Complexity Analysis of Winner Determination

10/15/2022
by   Lirong Xia, et al.
0

The computational complexity of winner determination is a classical and important problem in computational social choice. Previous work based on worst-case analysis has established NP-hardness of winner determination for some classic voting rules, such as Kemeny, Dodgson, and Young. In this paper, we revisit the classical problem of winner determination through the lens of semi-random analysis, which is a worst average-case analysis where the preferences are generated from a distribution chosen by the adversary. Under a natural class of semi-random models that are inspired by recommender systems, we prove that winner determination remains hard for Dodgson, Young, and some multi-winner rules such as the Chamberlin-Courant rule and the Monroe rule. Under another natural class of semi-random models that are extensions of the Impartial Culture, we show that winner determination is hard for Kemeny, but is easy for Dodgson. This illustrates an interesting separation between Kemeny and Dodgson.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2020

The Smoothed Complexity of Computing Kemeny and Slater Rankings

The computational complexity of winner determination under common voting...
research
07/09/2021

Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability

We study winner determination for three prevalent k-committee selection ...
research
06/27/2023

The Distortion of Binomial Voting Defies Expectation

In computational social choice, the distortion of a voting rule quantifi...
research
07/31/2023

Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences

We investigate winner determination for two popular proportional represe...
research
11/19/2009

Manipulability of Single Transferable Vote

For many voting rules, it is NP-hard to compute a successful manipulatio...
research
06/11/2020

The Smoothed Possibility of Social Choice

We develop a framework to leverage the elegant "worst average-case" idea...
research
09/08/2015

On the complexity of piecewise affine system identification

The paper provides results regarding the computational complexity of hyb...

Please sign up or login with your details

Forgot password? Click here to reset