Fetching the paper…
Reading the bibliography…
Finding a representative cohort from a broad pool of candidates is a goal that arises in many contexts such as choosing governing committees and consumer panels.
Optimal flows in networks with multiple sources and sinks
Nimrod Megiddo · 1974
Earlier work this paper cites.
A good algorithm for lexicographically optimal flows in multi-terminal networks
Nimrod Megiddo · 1977
Earlier work this paper cites.
The ellipsoid method: A survey
Robert G Bland, Donald Goldfarb, and Michael J Todd · 1981
Earlier work this paper cites.
Lexicographic bottleneck problems
Rainer E Burkard and Franz Rendl · 1991
Earlier work this paper cites.
A threshold of ln n for approximating set cover
Uriel Feige · 1998
Earlier work this paper cites.
An improved general procedure for lexicographic bottleneck problems
Federico Della Croce, Vangelis Th Paschos, and Alexis Tsoukias · 1999
Earlier work this paper cites.
Fairness in routing and load balancing
Jon Kleinberg, Yuval Rabani, and Éva Tardos · 1999
Earlier work this paper cites.
Distributions on level-sets with applications to approximation algorithms
Aravind Srinivasan · 2001
Earlier work this paper cites.
Telecommunications network design and max-min optimization problem
Wlodzimierz Ogryczak, Michal Pióro, and Artur Tomaszewski · 2005
Earlier work this paper cites.
Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation
Miriam Allalouf and Yuval Shavitt · 2007
Earlier work this paper cites.
Algorithms for leximin-optimal fair policies in repeated games
Gabriel Balan, Dana Richards, and Sean Luke · 2008
Cited alongside, same era.
Max-min fairness and its applications to routing and load-balancing in communication networks: A tutorial
Dritan Nace and Michal Pióro · 2008
Cited alongside, same era.
Chernoff–Hoeffding Bounds
Devdatt P. Dubhashi and Alessandro Panconesi · 2009
Cited alongside, same era.
Multiwinner elections with diversity constraints
Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, and Piotr Skowron · 2017
Cited alongside, same era.
Multiwinner voting with fairness constraints
L Elisa Celis, Lingxiao Huang, and Nisheeth K Vishnoi · 2017
Cited alongside, same era.
Fair k-center clustering for data summarization
Matthäus Kleindessner, Pranjal Awasthi, and Jamie Morgenstern · 2019
Later among the works it cites.
Probabilistic Tools for the Analysis of Randomized Optimization Heuristics
Benjamin Doerr · 2020
Later among the works it cites.
On fair selection in the presence of implicit variance
Vitalii Emelianov, Nicolas Gast, Krishna P Gummadi, and Patrick Loiseau · 2020
Later among the works it cites.
Minimax pareto fairness: A multi objective perspective
Natalia Martinez, Martin Bertran, and Guillermo Sapiro · 2020
Later among the works it cites.
Diversity and inclusion metrics in subset selection
Margaret Mitchell, Dylan Baker, Nyalleng Moorosi, Emily Denton, Ben Hutchinson, Alex Hanna, Timnit Gebru, and Jamie Morgenstern · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Candice Schumann, Samsara N Counts, Jeffrey S Foster, and John P Dickerson · 2017
Cited alongside, same era.
Fair and diverse dpp-based data summarization
Elisa Celis, Vijay Keswani, Damian Straszak, Amit Deshpande, Tarun Kathuria, and Nisheeth Vishnoi · 2018
Cited alongside, same era.
Selection problems in the presence of implicit bias
Jon Kleinberg and Manish Raghavan · 2018
Cited alongside, same era.
Leximin Allocations in the Real World
David Kurokawa, Ariel D. Procaccia, and Nisarg Shah · 2018
Cited alongside, same era.
Equitable allocations of indivisible goods
Rupert Freeman, Sujoy Sikdar, Rohit Vaish, and Lirong Xia · 2019
Cited alongside, same era.
Konstantina Bairaktari, Huy Le Nguyen, and Jonathan Ullman · 2021
Later among the works it cites.
Lexicographically Fair Learning: Algorithms and Generalization
Emily Diana, Wesley Gill, Ira Globus-Harris, Michael Kearns, Aaron Roth, and Saeed Sharifi-Malvajerdi · 2021
Later among the works it cites.
Fair algorithms for selecting citizens’ assemblies
Bailey Flanigan, Paul Gölz, Anupam Gupta, Brett Hennig, and Ariel D Procaccia · 2021
Later among the works it cites.
Pareto efficient fairness in supervised learning: From extraction to tracing
Mohammad Mahdi Kamani, Rana Forsati, James Z Wang, and Mehrdad Mahdavi · 2021
Later among the works it cites.
Blind pareto fairness and subgroup robustness
Natalia L Martinez, Martin A Bertran, Afroditi Papadaki, Miguel Rodrigues, and Guillermo Sapiro · 2021
Later among the works it cites.