The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
An Axiomatic Theory of Fairness in Network Resource Allocation
Open accessAbstract
We present five axioms for fairness measures in resource allocation. A family of fairness measures satisfying the axioms is constructed. Special cases of this family include ¿-fairness, Jain's index, and entropy. 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 fairness measure, a new understanding of ¿-fair utility functions, and an interpretation of "larger ¿ is more fair". We also construct an alternative set of axioms to capture system efficiency and feasibility constraints.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nash, J. F. (1950) · Econometrica · doi:10.2307/1907266 · Cited by 7,840
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Shapley, L. S. (1988) · The Shapley Value · doi:10.1017/cbo9780511528446.003 · Cited by 4,954
Jain, R., Chiu, D. M., & Hawe, W. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/9809099 · Cited by 3,523
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600523 · Cited by 2,399
Fair end-to-end window-based congestion control
Mo, J., & Walrand, J. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.879343 · Cited by 2,095
An analysis of short-term fairness in wireless media access protocols (poster session)
Koksal, C. E., Kassab, H., & Balakrishnan, H. (2000) · Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/339331.339401 · Cited by 245
On the Distribution Function of Additive Functions
Erdos, P. (1946) · The Annals of Mathematics · doi:10.2307/1969031 · Cited by 185
Axioms of Cooperative Decision Making.
THOMSON, W. J., & Moulin, H. J. (1990) · Economica · doi:10.2307/2554720 · Cited by 159
A new fairness index for radio resource allocation in wireless networks
Dianati, M., Shen, X., & Naik, S. (2005) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc.2005.1424595 · Cited by 152
Cited by
Fair Resource Allocation in Federated Learning
Li, T., Sanjabi, M., Beirami, A., & Smith, V. (2019) · arXiv · doi:10.48550/arxiv.1905.10497 · Cited by 475
TCP ex machina: computer-generated congestion control
Winstein, K., & Balakrishnan, H. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486020 · Cited by 332
On the Efficiency-Fairness Trade-off
Bertsimas, D., Farias, V. F., & Trichakis, N. (2012) · Management Science · doi:10.1287/mnsc.1120.1549 · Cited by 294
Heterogeneity-aware fair federated learning
Li, X., Zhao, S., Chen, C., & Zheng, Z. (2023) · Information Sciences · doi:10.1016/j.ins.2022.11.031 · Cited by 43
Locality-aware Fair Scheduling in LLM Serving
Cao, S., Wang, Y., Mao, Z., Hsu, P.-L., Yin, L., Xia, T., Li, D., Liu, S., Zhang, Y., Zhou, Y., et al. (2025) · arXiv · doi:10.48550/arxiv.2501.14312
Metadata
- Authors
- Lan, T., Kao, D., Chiang, M., & Sabharwal, A.
- Venue
- 2010 Proceedings IEEE INFOCOM
- Publisher
- IEEE
- Published
- 2010-03
- Pages
- 1-9
- OpenAlex
- W2122011919
- Cited by
- 418
- References
- 12
- FWCI
- 17.35
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Axiomatic Theory of Fairness in Network Resource Allocation. https://app.cochat.ai/papers/10.1109/infcom.2010.5461911
- The paper
- Lan, T., Kao, D., Chiang, M., & Sabharwal, A. (2010). An Axiomatic Theory of Fairness in Network Resource Allocation. 2010 Proceedings IEEE INFOCOM. https://doi.org/10.1109/infcom.2010.5461911
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.