Price-based protocols for fair resource allocation

DOI10.1145/2556949zbMath1321.68046OpenAlexW2098772063MaRDI QIDQ5501959

Hamid Nazerzadeh, Ashish Goel

Publication date: 14 August 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2556949

zbMATH Keywords

fairnessdecentralized algorithmsmajorizationnetwork protocolsshadow pricesLeontief utilities

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Network protocols (68M12)

Related Items (1)

Markets for public decision-making

Cites Work

• Fair online load balancing
• Simultaneous optimization via approximate majorization for concave profits or convex costs
• The complexity of computing a Nash equilibrium
• Pricing for fairness
• Approximate majorization and fair online load balancing
• Understanding TCP Vegas
• Fairness Measures for Resource Allocation
• Leontief economies encode nonzero sum two-player games
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
• All-norm approximation algorithms
• Fast Approximation Algorithms for Fractional Packing and Covering Problems
• Algorithm Theory - SWAT 2004
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Inequalities: theory of majorization and its applications
• Fairness in routing and load balancing
• Combining fairness with throughput: Online routing with multiple objectives

This page was built for publication: Price-based protocols for fair resource allocation