The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
A Unified Framework for Max-Min and Min-Max Fairness With Applications
Open accessAbstract
Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing it; in most, but not all cases, they are based on the notion of bottlenecks. In spite of this wide applicability, there are still examples, arising in the context of wireless or peer-to-peer networks, where the existing theories do not seem to apply directly. In this paper, we give a unifying treatment of max-min fairness, which encompasses all existing results in a simplifying framework, and extend its applicability to new examples. First, we observe that the existence of max-min fairness is actually a geometric property of the set of feasible allocations. There exist sets on which max-min fairness does not exist, and we describe a large class of sets on which a max-min fair allocation does exist. This class contains, but is not limited to the compact, convex sets of$\BBR^N$. Second, we give a general purpose centralized algorithm, called Max-min Programming, for computing the max-min fair allocation in all cases where it exists (whether the set of feasible allocations is in our class or not). Its complexity is of the order of$N$linear programming steps in$\BBR^N$, in the case where the feasible set is defined by linear constraints. We show that, if the set of feasible allocations has the free disposal property, then Max-min Programming reduces to a simpler algorithm, called Water Filling, whose complexity is much lower. Free disposal corresponds to the cases where a bottleneck argument can be made, and Water Filling is the general form of all previously known centralized algorithms for such cases.
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
A Theory of Justice: Original Edition
Rawls, J. (1971) · doi:10.4159/9780674042605 · Cited by 9,496
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
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
Win, M. Z., & Scholtz, R. A. (2000) · IEEE Transactions on Communications · doi:10.1109/26.843135 · Cited by 2,526
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
Optimization flow control. I. Basic algorithm and convergence
Low, S. H., & Lapsely, D. E. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811451 · Cited by 1,972
Minimum energy mobile wireless networks
Rodoplu, V., & Meng, T. H. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.779917 · Cited by 1,685
Energy conserving routing in wireless ad-hoc networks
Chang, J.-H., & Tassiulas, L. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832170 · Cited by 1,669
A digital fountain approach to reliable distribution of bulk data
Byers, J. W., Luby, M., Mitzenmacher, M., & Rege, A. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285258 · Cited by 1,138
Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green
Hara, C., Segal, I., & Tadelis, S. (1997) · Oxford University Press eBooks · Cited by 992
Cited by
Stochastic Geometry and Wireless Networks: Volume I Theory
Baccelli, F. (2009) · now publishers, Inc. eBooks · doi:10.1561/9781601982650 · Cited by 867
Bertsimas, D., Farias, V. F., & Trichakis, N. (2011) · Operations Research · doi:10.1287/opre.1100.0865 · Cited by 656
Stochastic Geometry and Wireless Networks: Volume I Theory
Baccelli, F., & Błaszczyszyn, B. (2010) · Foundations and Trends® in Networking · doi:10.1561/1300000006 · Cited by 497
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
Fairness in wireless networks: Issues, measures and challenges
Shi, H., Prasad, R. V., Onur, E., & Niemegeers, I. G. M. M. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.050113.00015 · Cited by 446
Metadata
- Authors
- Radunovic, B., & Le Boudec, J.-Y.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2007-10
- Volume
- 15
- Issue
- 5
- Pages
- 1073-1083
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W2126143263
- Cited by
- 345
- References
- 16
- FWCI
- 27.75
- Type
- journal article
- 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: A Unified Framework for Max-Min and Min-Max Fairness With Applications. https://app.cochat.ai/papers/10.1109/tnet.2007.896231
- The paper
- Radunovic, B., & Le Boudec, J.-Y. (2007). A Unified Framework for Max-Min and Min-Max Fairness With Applications. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/tnet.2007.896231
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.