Author:
Bredereck Robert,Faliszewski Piotr,Igarashi Ayumi,Lackner Martin,Skowron Piotr
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.
Publisher
Association for the Advancement of Artificial Intelligence (AAAI)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Ranking with Slot Constraints;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24
2. Fairness in Streaming Submodular Maximization Subject to a Knapsack Constraint;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24
3. A Mechanism for Participatory Budgeting with Funding Constraints and Project Interactions;Web and Internet Economics;2023-12-31
4. Multi-winner Approval Voting with Grouped Voters;Combinatorial Optimization and Applications;2023-12-09
5. Trichotomous Votes Election with Graph Constraint;2023 18th International Conference on Intelligent Systems and Knowledge Engineering (ISKE);2023-11-17