DeepAI AI Chat
Log In Sign Up

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

by   Lirong Xia, et al.

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.


page 1

page 2

page 3

page 4


The Smoothed Complexity of Computing Kemeny and Slater Rankings

The computational complexity of winner determination under common voting...

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

We study winner determination for three prevalent k-committee selection ...

Manipulability of Single Transferable Vote

For many voting rules, it is NP-hard to compute a successful manipulatio...

Where are the really hard manipulation problems? The phase transition in manipulating the veto rule

Voting is a simple mechanism to aggregate the preferences of agents. Man...

The Smoothed Possibility of Social Choice

We develop a framework to leverage the elegant "worst average-case" idea...

Halting Time is Predictable for Large Models: A Universality Property and Average-case Analysis

Average-case analysis computes the complexity of an algorithm averaged o...

Fishing out Winners from Vote Streams

We investigate the problem of winner determination from computational so...