Multiwinner Elections with Diversity Constraints

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.

[1]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[2]  Chandra Chekuri,et al.  Submodular function maximization via the multilinear relaxation and contention resolution schemes , 2011, STOC '11.

[3]  Piotr Faliszewski,et al.  Multiwinner Voting: A New Challenge for Social Choice Theory , 2017 .

[4]  Arnaud Fréville,et al.  The multidimensional 0-1 knapsack problem: An overview , 2004, Eur. J. Oper. Res..

[5]  Piotr Faliszewski,et al.  Achieving fully proportional representation: Approximability results , 2013, Artif. Intell..

[6]  Yu Yokoi,et al.  A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas , 2017, Math. Oper. Res..

[7]  Piotr Faliszewski,et al.  Committee Scoring Rules: Axiomatic Classification and Hierarchy , 2016, IJCAI.

[8]  András Frank,et al.  A Weighted Matroid Intersection Algorithm , 1981, J. Algorithms.

[9]  W. Lucas.  Fair Representation: Meeting the Ideal of One Man, One Vote. By Michel L. Balinski and H. Peyton Young , 1985 .

[10]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[11]  Vahab S. Mirrokni,et al.  Non-monotone submodular maximization under matroid and knapsack constraints , 2009, STOC '09.

[12]  Steven J. Brams,et al.  CONSTRAINED APPROVAL VOTING: A VOTING SYSTEM TO ELECT A GOVERNING BOARD , 1990 .

[13]  Michel Balinski,et al.  An Axiomatic Approach to Proportionality Between Matrices , 1989, Math. Oper. Res..

[14]  Michel Balinski,et al.  Algorithms for proportional matrices in reals and integers , 1989, Math. Program..

[15]  George Mavrotas,et al.  Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms , 2010, Eur. J. Oper. Res..

[16]  Nisheeth K. Vishnoi,et al.  Group Fairness in Multiwinner Voting , 2017, ArXiv.

[17]  H. Peyton Young,et al.  Fair Representation: Meeting the Ideal of One Man, One Vote , 1982 .

[18]  Piotr Faliszewski,et al.  Mixed Integer Programming with Convex/Concave Constraints: Fixed-Parameter Tractability and Applications to Multicovering and Voting , 2020, Theor. Comput. Sci..

[19]  Piotr Faliszewski,et al.  Finding a collective set of items: From proportional multirepresentation to group recommendation , 2014, Artif. Intell..

[20]  Ariel D. Procaccia,et al.  On the complexity of achieving proportional representation , 2008, Soc. Choice Welf..

[21]  John R. Chamberlin,et al.  Representative Deliberations and Representative Decisions: Proportional Representation and the Borda Rule , 1983, American Political Science Review.

[22]  Piotr Faliszewski,et al.  The complexity of fully proportional representation for single-crossing electorates , 2013, Theor. Comput. Sci..

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  J. Edmonds.  Matroid Intersection , 2022 .

[25]  Satoru Iwata,et al.  Submodular Function Minimization under Covering Constraints , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[26]  Edith Elkind,et al.  Structure in Dichotomous Preferences , 2015, IJCAI.

[27]  Piotr Faliszewski,et al.  Fully Proportional Representation with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time , 2015, AAAI.

[28]  Jérôme Lang,et al.  Multi-Attribute Proportional Representation , 2015, AAAI.

[29]  Maxim Sviridenko,et al.  A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..

[30]  Hadas Shachnai,et al.  Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints , 2013, Math. Oper. Res..

[31]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[32]  Gérard Cornuéjols,et al.  General factors of graphs , 1988, J. Comb. Theory, Ser. B.

[33]  Yang Yu,et al.  On Subset Selection with General Cost Constraints , 2017, IJCAI.

[34]  Martin Lackner,et al.  Preferences Single-Peaked on a Circle , 2017, AAAI.

[35]  Günther R. Raidl,et al.  The Multidimensional Knapsack Problem: Structure and Algorithms , 2010, INFORMS J. Comput..

[36]  Nadja Betzler,et al.  On the Computation of Fully Proportional Representation , 2011, J. Artif. Intell. Res..

[37]  Craig Boutilier,et al.  Social Choice : From Consensus to Personalized Decision Making , 2011 .

[38]  Dariusz Wagner,et al.  Computer-assisted constrained approval voting , 1993 .

[39]  Edith Elkind,et al.  Multiwinner Elections Under Preferences That Are Single-Peaked on a Tree , 2013, IJCAI.

[40]  Andreas Krause,et al.  Submodular Function Maximization , 2014, Tractability.