Candidate selections with proportional fairness constraints

[1]  Omri Weinstein,et al.  A faster algorithm for solving general LPs , 2021, STOC.

[2]  Robert Ganian,et al.  Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP , 2020, IJCAI.

[3]  Xiaohui Bei,et al.  Fair Division of Mixed Divisible and Indivisible Goods , 2019, AAAI.

[4]  Toby Walsh,et al.  From Matching with Diversity Constraints to Matching with Regional Quotas , 2019, AAMAS.

[5]  A. Saberi,et al.  Assignment Mechanisms under Distributional Constraints , 2018, SODA.

[6]  Makoto Yokoo,et al.  Efficient Allocation Mechanism with Endowments and Distributional Constraints , 2018, AAMAS.

[7]  Makoto Yokoo,et al.  Designing matching mechanisms under constraints: An approach from discrete convex analysis , 2018, J. Econ. Theory.

[8]  Jianxin Wang,et al.  Multiwinner Voting with Restricted Admissible Sets: Complexity and Strategyproofness , 2018, IJCAI.

[9]  Haris Aziz,et al.  A Rule for Committee Selection with Soft Diversity Constraints , 2018, Group Decision and Negotiation.

[10]  Yair Zick,et al.  Diversity Constraints in Public Housing Allocation , 2017, AAMAS.

[11]  Piotr Faliszewski,et al.  Multiwinner Elections with Diversity Constraints , 2017, AAAI.

[12]  Piotr Faliszewski,et al.  The Complexity of Multiwinner Voting Rules with Variable Number of Winners , 2017, ArXiv.

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

[14]  Nisheeth K. Vishnoi,et al.  Multiwinner Voting with Fairness Constraints , 2017, IJCAI.

[15]  Rakesh V. Vohra,et al.  Stable Matching with Proportionality Constraints , 2017, EC.

[16]  D. Kilgour Approval elections with a variable number of winners , 2016 .

[17]  D. Kilgour Approval elections with a variable number of winners , 2016, Theory and Decision.

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

[19]  Peter Troyan,et al.  Improving Matching under Hard Distributional Constraints , 2015 .

[20]  Makoto Yokoo,et al.  Controlled School Choice with Soft Bounds and Overlapping Types , 2015, AAAI.

[21]  Muhammed A. Yıldırım,et al.  School Choice with Controlled Choice Constraints: Hard Bounds Versus Soft Bounds , 2011, J. Econ. Theory.

[22]  Jan Vondrák,et al.  Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..

[23]  Isa Emin Hafalir,et al.  Effective affirmative action in school choice , 2011 .

[24]  David Manlove,et al.  The College Admissions problem with lower and common quotas , 2010, Theor. Comput. Sci..

[25]  Eric Budish,et al.  The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.

[26]  Mohit Singh,et al.  Degree bounded matroids and submodular flows , 2008, Comb..

[27]  Atila Abdulkadiroglu,et al.  College admissions with affirmative action , 2005, Int. J. Game Theory.

[28]  Piotr Faliszewski,et al.  Multiwinner Rules with Variable Number of Winners , 2020, ECAI.

[29]  A. Mackay On complexity , 2001 .

[30]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.