Computational social choice

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

The computational complexity of winner determination is a classical and important problem in computational social choice. Previous work …

Lirong Xia, Weiqiang Zheng