Virginia Vassilevska Williams

Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules

We present an almost optimal algorithm for the classic Chamberlin-Courant multiwinner voting rule (CC) on single-peaked preference profiles. Given n voters and m candidates, it runs in almost linear time in the input size improving the previous best O(nm^2) time algorithm. We also study multiwinner…