Multiwinner Elections With Diversity Constraints

Authors

  • Robert Bredereck TU Berlin
  • Piotr Faliszewski AGH University
  • Ayumi Igarashi University of Oxford
  • Martin Lackner TU Wien
  • Piotr Skowron TU Berlin

DOI:

https://doi.org/10.1609/aaai.v32i1.11457

Keywords:

multi-winner elections, approximation algorithms, diversity, computational social choice, voting

Abstract

We develop a model of multiwinner elections that combines performance-based measures of the quality of the committee (such as, e.g., Borda scores of the committee members) with diversity constraints. Specifically, we assume that the candidates have certain attributes (such as being a male or a female, being junior or senior, etc.) and the goal is to elect a committee that, on the one hand, has as high a score regarding a given performance measure, but that, on the other hand, meets certain requirements (e.g., of the form "at least 30% of the committee members are junior candidates and at least 40% are females"). We analyze the computational complexity of computing winning committees in this model, obtaining polynomial-time algorithms (exact and approximate) and NP-hardness results. We focus on several natural classes of voting rules and diversity constraints.

Downloads

Published

2018-04-25

How to Cite

Bredereck, R., Faliszewski, P., Igarashi, A., Lackner, M., & Skowron, P. (2018). Multiwinner Elections With Diversity Constraints. Proceedings of the AAAI Conference on Artificial Intelligence, 32(1). https://doi.org/10.1609/aaai.v32i1.11457

Issue

Section

AAAI Technical Track: Game Theory and Economic Paradigms