The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
The Price of Fairness
Abstract
In this paper we study resource allocation problems that involve multiple self-interested parties or players and a central decision maker. We introduce and study the price of fairness, which is the relative system efficiency loss under a “fair” allocation assuming that a fully efficient allocation is one that maximizes the sum of player utilities. We focus on two well-accepted, axiomatically justified notions of fairness, viz., proportional fairness and max-min fairness. For these notions we provide a tight characterization of the price of fairness for a broad family of problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Goldsmith, A. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511841224 · Cited by 10,658
A Theory of Justice: Original Edition
Rawls, J. (1971) · doi:10.4159/9780674042605 · Cited by 9,496
(2006) · Choice Reviews Online · doi:10.5860/choice.43-4686 · Cited by 8,128
Nash, J. F. (1950) · Econometrica · doi:10.2307/1907266 · Cited by 7,840
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
Sen, A., & Foster, J. (1973) · doi:10.1093/0198281935.001.0001 · Cited by 3,429
Introduction to linear optimization
Bertsimas, D., & Tsitsiklis, J. N. (1997) · Cited by 2,705
Self-citationFair 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
Koutsoupias, E., & Papadimitriou, C. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49116-3_38 · Cited by 1,806
Other Solutions to Nash's Bargaining Problem
Kalai, E., & Smorodinsky, M. (1975) · Econometrica · doi:10.2307/1914280 · Cited by 1,799
Roughgarden, T., & Tardos, É. (2002) · Journal of the ACM · doi:10.1145/506147.506153 · Cited by 1,608
Algorithms, games, and the internet
Papadimitriou, C. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380883 · Cited by 1,085
Koutsoupias, E., & Papadimitriou, C. H. (2009) · Computer Science Review · doi:10.1016/j.cosrev.2009.04.003 · Cited by 687
Equity: In Theory and Practice
Kuenne, R. E., & Young, H. P. (1995) · Southern Economic Journal · doi:10.2307/1061013 · Cited by 658
The Air Traffic Flow Management Problem with Enroute Capacities
Bertsimas, D., & Patterson, S. S. (1998) · Operations Research · doi:10.1287/opre.46.3.406 · Cited by 540
Self-citationEfficiency Loss in a Network Resource Allocation Game
Johari, R., & Tsitsiklis, J. N. (2004) · Mathematics of Operations Research · doi:10.1287/moor.1040.0091 · Cited by 537
Robust Portfolio Optimization and Management
Fabozzi, F. J. (2007) · Cited by 398
A Unified Framework for Max-Min and Min-Max Fairness With Applications
Radunovic, B., & Le Boudec, J.-Y. (2007) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.896231 · Cited by 345
The Flow Management Problem in Air Traffic Control
Odoni, A. R. (1987) · Flow Control of Congested Networks · doi:10.1007/978-3-642-86726-2_17 · Cited by 251
Bertsimas, D., & Patterson, S. S. (2000) · Transportation Science · doi:10.1287/trsc.34.3.239.12300 · Cited by 243
Self-citationRate performance objectives of multihop wireless networks
Radunovic, B., & Le Boudec, J. Y. (2004) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2004.45 · Cited by 207
On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
Luss, H. (1999) · Operations Research · doi:10.1287/opre.47.3.361 · Cited by 188
Fairness in Routing and Load Balancing
Kleinberg, J., Rabani, Y., & Tardos, É. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2001.1752 · Cited by 163
Flow Control of Congested Networks
Odoni, A. R., Bianco, L., & Szegö, G. P. (1987) · Springer eBooks · doi:10.1007/978-3-642-86726-2 · Cited by 142
Fairness in routing and load balancing
Kleinberg, J. M., Rabani, Y., & Eva Tardos, D. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sffcs.1999.814631 · Cited by 108
The “Price of Anarchy” Under Nonlinear and Asymmetric Costs
Perakis, G. (2007) · Mathematics of Operations Research · doi:10.1287/moor.1070.0258 · Cited by 94
Vossen, T. W. M., Ball, M. O., Hoffman, R., & Wambsganss, M. C. (2003) · Air Traffic Control Quarterly · doi:10.2514/atcq.11.4.277 · Cited by 79
Is fair allocation always inefficient
Tang, A., Wang, J., & Low, S. H. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2004.1354479 · Cited by 67
The Price of Anarchy when Costs Are Non-separable and Asymmetric
Perakis, G. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25960-2_4 · Cited by 60
Cited by
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
Self-citationCake cutting: not just child's play
Procaccia, A. D. (2013) · Communications of the ACM · doi:10.1145/2483852.2483870 · Cited by 156
Metadata
- Authors
- Bertsimas, D., Farias, V. F., & Trichakis, N.
- Venue
- Operations Research
- Published
- 2011-02
- Volume
- 59
- Issue
- 1
- Pages
- 17-31
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2013518095
- Cited by
- 656
- References
- 30
- FWCI
- 50.72
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.