Fair Packing and Covering on a Relative Scale
Jelena Diakonikolas, Maryam Fazel, Lorenzo Orecchia

TL;DR
This paper introduces a fast first-order method for solving $oldsymbol{ ext{alpha}}$-fair packing and covering problems with relative-error guarantees, advancing the efficiency of fair resource allocation solutions in optimization.
Contribution
It presents a novel, efficient first-order algorithm for $oldsymbol{ ext{alpha}}$-fair packing and covering problems with relative-error guarantees, and introduces a new $oldsymbol{ ext{alpha}}$-fairness concept for minimization.
Findings
The proposed method has significantly lower convergence time than existing algorithms.
First near-linear-time solvers for $oldsymbol{ ext{alpha}}$-fair covering problems with relative-error guarantees.
The Approximate Duality Gap Technique offers an intuitive convergence analysis.
Abstract
Fair resource allocation is a fundamental optimization problem with applications in operations research, networking, and economic and game theory. Research in these areas has led to the general acceptance of a class of -fair utility functions parameterized by . We consider -fair packing -- the problem of maximizing -fair utilities under positive linear constraints -- and provide a simple first-order method for solving it with relative-error guarantees. The method has a significantly lower convergence time than the state of the art, and to analyze it, we leverage the Approximate Duality Gap Technique, which provides an intuitive interpretation of the convergence argument. Finally, we introduce a natural counterpart of -fairness for minimization problems and motivate its usage in the context of fair task allocation. This…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
