Multi-Winner Elections: Complexity of Manipulation, Control and Winner-Determination
- Ariel D. Procaccia ,
- Jeffrey S. Rosenschein ,
- Aviv Zohar
IJCAI '07: Proceedings of the Twentieth International Joint Conference on Artificial Intelligence |
Published by AAAI Press
Although recent years have seen a surge of interest in the computational aspects of social choice, no attention has previously been devoted to elections with multiple winners, e.g., elections of an assembly or committee. In this paper, we fully characterize the worst-case complexity of manipulation and control in the context of four prominent multi-winner voting systems. Additionally, we show that several tailor-made multi-winner voting schemes are impractical, as it is NP-hard to select the winners in these schemes.
Also appeared at AMEC06.