Simultaneous optimization via approximate majorization for concave profits or convex costs

DOI10.1007/S00453-005-1177-7MaRDI QIDQ2498404zbMATH OpenOpenAlexFDO

Authors Ashish Goel, Adam Meyerson

Publication date 16 August 2006

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-005-1177-7

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Management decision making, including multiple objectives (90B50)

Recommendations

• Performance of global load balancing by local adjustment
• Approximate majorization and fair online load balancing
• Pricing for fairness: distributed resource allocation for multiple objectives
• Approximate majorization and fair online load balancing
• Fairness Measures for Resource Allocation

Cited in

(10)

• Fair welfare maximization
• Surrogate optimization for \(p\)-norms
• Approximate tradeoffs on weighted labeled matroids
• Optimal allocation for chunked-reward advertising
• Fair online load balancing
• Simultaneous approximation of multi-criteria submodular function maximization
• Simpler and Better Algorithms for Minimum-Norm Load Balancing
• Price-based protocols for fair resource allocation, convergence time analysis and extension to Leontief utilities
• Approximate minimum tree cover in all symmetric monotone norms simultaneously
• Pricing for fairness: distributed resource allocation for multiple objectives

This page was built for publication: Simultaneous optimization via approximate majorization for concave profits or convex costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2498404)