Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 418

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 access
Lan, Tian, Kao, David, Chiang, Mung, Sabharwal, Ashutosh·2010·2010 Proceedings IEEE INFOCOM

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/infcom.2010.5461911

Cites

12 of 12 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 12 references

Cited by

See all 418

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.