Search Results for author:
Found 2 papers, 0 papers with code
Gerrymandering Planar Graphs
This motivates the study of approximation algorithms for gerrymandering planar graphs.
Fair Algorithm Design: Fair and Efficacious Machine Scheduling
In this paper, we prove that this dichotomy between fairness and efficacy can be overcome if we allow for a negligible amount of bias: there exist algorithms that are both "almost perfectly fair" and have a constant factor efficacy ratio, that is, are guaranteed to output solutions that have social welfare within a constant factor of optimal welfare.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
