An Axiomatic Theory of Fairness in Network Resource Allocation

2009/06/02 by Tian Lan, David Kao, Lan, Tian +5 · 5 citations
Computer Science · Engineering · #Advanced Wireless Network Optimization #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Network Traffic and Congestion Control #Networking and Internet Architecture (cs.NI) #Performance (cs.PF)

paper · pdf · doi:10.48550/arxiv.0906.0557

openalex publication_date 2009/06/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We present a set of five axioms for fairness measures in resource allocation. A family of fairness measures satisfying the axioms is constructed. Well-known notions such as alpha-fairness, Jain's index, and entropy are shown to be special cases. Properties of fairness measures satisfying the axioms are proven, including Schur-concavity. Among the engineering implications is a generalized Jain's index that tunes the resolution of the fairness measure, a new understanding of alpha-fair utility functions, and an interpretation of "larger alpha is more fair". We also construct an alternative set of four axioms to capture efficiency objectives and feasibility constraints.

Cited by

• Invariant Price of Anarchy: a Metric for Welfarist Traffic Control
• DISPATCH -- Decentralized Informed Spatial Planning and Assignment of Tasks for Cooperative Heterogeneous Agents
• Bandwidth-Constrained Sensor Scheduling: A Trade-off between Fairness and Efficiency
• FedShard: Federated Unlearning with Efficiency Fairness and Performance Fairness
• A Mood Value for Fair Resource Allocations

Related

• A Mood Value for Fair Resource Allocations
• A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems
• No justified complaints: On fair sharing of multiple resources
• Multi-resource fairness: Objectives, algorithms and performance
• Welfare Measure for Resource Allocation with Algorithmic Implementation: Beyond Average and Max-Min