Fetching the paper…
Reading the bibliography…
Multiwinner voting rules are used to select a small representative subset of candidates or items from a larger set given the preferences of voters.
The elementary statistics of majority voting
Lionel S Penrose · 1946
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions - I
George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher · 1978
Earlier work this paper cites.
Representative deliberations and representative decisions: Proportional representation and the Borda rule
John R Chamberlin and Paul N Courant · 1983
Earlier work this paper cites.
Report of the Royal Commission on the Electoral System: Towards a Better Democracy
New Zealand · 1986
Earlier work this paper cites.
Constrained approval voting: A voting system to elect a governing board
Steven J Brams · 1990
Earlier work this paper cites.
Use of linear programming for constrained approval voting
R Potthoff · 1990
Earlier work this paper cites.
Fully proportional representation
Burt L Monroe · 1995
Earlier work this paper cites.
The single transferable vote
Nicolaus Tideman · 1995
Earlier work this paper cites.
Clique is hard to approximate within n 1 − ε n^{1-\varepsilon}
Johan Håstad · 1996
Earlier work this paper cites.
Hardness of approximating problems on cubic graphs
Paola Alimonti and Viggo Kann · 1997
Earlier work this paper cites.
A threshold of ln n \ln n for approximating set cover
Uriel Feige · 1998
Earlier work this paper cites.
Combinatorial optimization: polyhedra and efficiency
Alexander Schrijver · 2002
Earlier work this paper cites.
On the complexity of approximating k k -dimensional matching
Elad Hazan, Shmuel Safra, and Oded Schwartz · 2003
Earlier work this paper cites.
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks
Piotr Berman, Bhaskar DasGupta, and Eduardo D. Sontag · 2004
Earlier work this paper cites.
Probability and computing - randomized algorithms and probabilistic analysis
Michael Mitzenmacher and Eli Upfal · 2005
Earlier work this paper cites.
Linear degree extractors and the inapproximability of max clique and chromatic number
David Zuckerman · 2006
Earlier work this paper cites.
The spatial model of politics
Norman Schofield · 2007
Earlier work this paper cites.
On the complexity of achieving proportional representation
Ariel D Procaccia, Jeffrey S Rosenschein, and Aviv Zohar · 2008
Earlier work this paper cites.
Representing utility functions via weighted goals
Joel Uckelman, Yann Chevaleyre, Ulle Endriss, and Jérôme Lang · 2009
Earlier work this paper cites.
Dependent randomized rounding via exchange properties of combinatorial structures
Chandra Chekuri, Jan Vondrak, and Rico Zenklusen · 2010
Cited alongside, same era.
Alice and Bob will fight: the problem of electing a committee in the presence of candidate interdependence
Joel Uckelman · 2010
Cited alongside, same era.
Maximizing a monotone submodular function subject to a matroid constraint
Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák · 2011
Cited alongside, same era.
Budgeted social choice: From consensus to personalized decision making
Tyler Lu and Craig Boutilier · 2011
Cited alongside, same era.
Fairness through awareness
Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard Zemel · 2012
Cited alongside, same era.
Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment
Multi-attribute proportional representation
Jérôme Lang and Piotr Krzysztof Skowron · 2016
Later among the works it cites.
Justified representation in approval-based committee voting
Haris Aziz, Markus Brill, Vincent Conitzer, Edith Elkind, Rupert Freeman, and Toby Walsh · 2017
Closest in time.
The Condorcet principle for multiwinner elections: From shortlisting to proportionality
Haris Aziz, Edith Elkind, Piotr Faliszewski, Martin Lackner, and Piotr Skowron · 2017
Closest in time.
Multiwinner approval rules as apportionment methods
Markus Brill, Jean-François Laslier, and Piotr Skowron · 2017
Closest in time.
Preparing for the future of artificial intelligence
Alan Bundy · 2017
Closest in time.
On the complexity of constrained determinantal point processes
L. Elisa Celis, Amit Deshpande, Tarun Kathuria, Damian Straszak, and Nisheeth K. Vishnoi · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Paolo Serafini and Bruno Simeone · 2012
Cited alongside, same era.
On the computation of fully proportional representation
Nadja Betzler, Arkadii Slinko, and Johannes Uhlmann · 2013
Cited alongside, same era.
Effective recruiting for diversity
Joanne McGrath Cohoon, James P. Cohoon, Seth Reichelson, and Selwyn Lawrence · 2013
Cited alongside, same era.
Optimal apportionment
Yukio Koriyama, Antonin Macé, Rafael Treibich, and Jean-François Laslier · 2013
Cited alongside, same era.
Learning fair representations
Rich Zemel, Yu Wu, Kevin Swersky, Toni Pitassi, and Cynthia Dwork · 2013
Cited alongside, same era.
Properties of multiwinner voting rules
Edith Elkind, Piotr Faliszewski, Piotr Skowron, and Arkadii Slinko · 2014
Cited alongside, same era.
Bidimensional allocation of seats via zero-one matrices with given line sums
Isabella Lari, Federica Ricca, and Andrea Scozzari · 2014
Cited alongside, same era.
Closest in time.
Fair Personalization
L. Elisa Celis and Nisheeth K. Vishnoi · 2017
Closest in time.
What do multiwinner voting rules do? an experiment over the two-dimensional euclidean domain
Edith Elkind, Piotr Faliszewski, Jean-François Laslier, Piotr Skowron, Arkadii Slinko, and Nimrod Talmon · 2017
Closest in time.
Multiwinner voting: A new challenge for social choice theory
Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, and Nimrod Talmon · 2017
Closest in time.
Greed is good: Near-optimal submodular maximization via greedy optimization
Moran Feldman, Christopher Harshaw, and Amin Karbasi · 2017
Closest in time.
http://www.representation2020.com/voting_rules_pose_barrier_for_women
Representation2020 · 2017
Closest in time.
How To Conduct Diverse Recruitment
Alistair Reyland · 2017
Closest in time.
Measuring fairness in ranked outputs
Ke Yang and Julia Stoyanovich · 2017
Closest in time.
Fairness beyond disparate treatment & disparate impact: Learning classification without disparate mistreatment
Muhammad Bilal Zafar, Isabel Valera, Manuel Gomez-Rodriguez, and Krishna P. Gummadi · 2017
Closest in time.
Fairness constraints: Mechanisms for fair classification
Muhammad Bilal Zafar, Isabel Valera, Manuel Gomez-Rodriguez, and Krishna P. Gummadi · 2017
Closest in time.
Multiwinner elections with diversity constraints
Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, and Piotr Skowron · 2018
Closest in time.
Fair and diverse DPP-based data summarization
L. Elisa Celis, Vijay Keswani, Amit Deshpande, Tarun Kathuria, Damian Straszak, and Nisheeth K. Vishnoi · 2018
Closest in time.
Ranking with fairness constraints
L Elisa Celis, Damian Straszak, and Nisheeth K Vishnoi · 2018
Closest in time.