Fairness Measures for Resource Allocation
From MaRDI portal
Publication:3446812
DOI10.1137/S0097539703434966zbMath1120.90028OpenAlexW2101054149MaRDI QIDQ3446812
Publication date: 26 June 2007
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539703434966
Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (14)
Network QoS games: stability vs optimality tradeoff ⋮ Extra resource allocation: a DEA approach in the view of efficiencies ⋮ Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines ⋮ Fair online load balancing ⋮ Equitable scheduling on a single machine ⋮ Congestion games with failures ⋮ On fair division of a homogeneous good ⋮ Simultaneous approximation of multi-criteria submodular function maximization ⋮ How good are SPT schedules for fair optimality criteria ⋮ The efficiency of fair division ⋮ Pricing for fairness: distributed resource allocation for multiple objectives ⋮ Surrogate optimization for \(p\)-norms ⋮ Simultaneous approximation ratios for parallel machine scheduling problems ⋮ Price-based protocols for fair resource allocation
This page was built for publication: Fairness Measures for Resource Allocation
