Pricing for fairness: distributed resource allocation for multiple objectives
From MaRDI portal
Publication:973022
DOI10.1007/s00453-010-9405-1zbMath1344.68273OpenAlexW1964664476MaRDI QIDQ973022
Publication date: 28 May 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-010-9405-1
simultaneous optimizationdistributed algorithmbandwidth allocationmulti-path routingnetwork resource pricing
Deterministic network models in operations research (90B10) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Network protocols (68M12) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- Fair online load balancing
- Simultaneous optimization via approximate majorization for concave profits or convex costs
- Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
- Pricing for fairness
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Understanding TCP Vegas
- Fairness Measures for Resource Allocation
- Leontief economies encode nonzero sum two-player games
- Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Least Majorized Elements and Generalized Polymatroids
- A parallel approximation algorithm for positive linear programming
- Inequalities: theory of majorization and its applications
- Fairness in routing and load balancing
- Combining fairness with throughput: Online routing with multiple objectives
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Pricing for fairness: distributed resource allocation for multiple objectives