Fair Packing and Covering on a Relative Scale

DOI10.1137/19M1288516zbMath1491.90099arXiv1808.02517OpenAlexW3110918953MaRDI QIDQ5139838

Maryam Fazel, Lorenzo Orecchia, Jelena Diakonikolas

Publication date: 11 December 2020

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.02517

zbMATH Keywords

fairnessresource allocationrelative errorwidth-independent algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Duality theory (optimization) (49N15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• Lectures on convex optimization
• Stochastic Networks
• The Price of Fairness
• The Bargaining Problem
• The price of being near-sighted
• Stateless Distributed Gradient Descent for Positive Linear Programs
• Other Solutions to Nash's Bargaining Problem
• A Fast Distributed Stateless Algorithm for $\alpha$-Fair Packing Problems
• The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods
• Linear programming without the matrix
• A parallel approximation algorithm for positive linear programming
• An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems
• Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel

This page was built for publication: Fair Packing and Covering on a Relative Scale