Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The inversion paradox, and classification of fairness notions (2311.16770v2)

Published 28 Nov 2023 in cs.GT and cs.MA

Abstract: Several different fairness notions have been introduced in the context of fair allocation of goods. In this manuscript, we compare between some fairness notions that are used in settings in which agents have arbitrary (perhaps unequal) entitlements to the goods. This includes the proportional share, the anyprice share, the weighted maximin share, weighted envy freeness, maximum weight Nash social welfare and competitive equilibrium. We perform this comparison in two settings, that of a divisible homogeneous good and arbitrary valuations, and that of indivisible goods and additive valuations. Different fairness notions are not always compatible with each other, and might dictate selecting different allocations. The purpose of our work is to clarify various properties of fairness notions, so as to allow, when needed, to make an educated choice among them. Also, such a study may motivate introducing new fairness notions, or modifications to existing fairness notions. Among other properties, we introduce definitions for monotonicity that postulate that having higher entitlement should be better to the agent than having lower entitlement. Some monotonicity notions, such as population monotonicity and weight monotonicity, appeared in previous work, but we prefer to consider other monotonicity properties that we refer to as global monotonicity and individual monotonicity. We find that some of the fairness notions (but not all) violate our monotonicity properties in a strong sense, that we refer to as the inversion paradox. Under this paradox, a fairness notion enforces that the value received by an agent decreases when the entitlement of the agent increases.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (27)
  1. Fair division of indivisible goods: Recent progress and open questions. Artif. Intell., 322:103965, 2023.
  2. Truthful allocation mechanisms without payments: Characterization and implications on fairness. In Proceedings of the 2017 ACM Conference on Economics and Computation, EC’17, pages 545–562, 2017.
  3. Julius Barbanel. Game-theoretic algorithms for fair and strongly fair cake division with entitlements. Colloquium Mathematicae, 69(1):59–73, 1996.
  4. Allocating indivisible goods. SIGecom Exch., 5(3):11–18, 2005.
  5. Fair-share allocations for agents with arbitrary entitlements. In EC ’21: The 22nd ACM Conference on Economics and Computation, Budapest, Hungary, July 18-23, 2021, page 127. ACM, 2021.
  6. Fair shares: Feasibility, domination and incentives. In EC ’22: The 23rd ACM Conference on Economics and Computation, 2022, page 435. ACM, 2022.
  7. Competitive equilibrium with generic budgets: Beyond additive. arXiv preprint arXiv:1911.09992, 2019.
  8. Competitive equilibrium with indivisible goods and generic budgets. Mathematics of Operations Research, 46(1):382–403, 2021.
  9. Fair Division: From cake-cutting to dispute resolution. Cambridge University Press, 1996.
  10. Eric Budish. The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy, 119(6):1061–1103, 2011.
  11. Youngsub Chun. The solidarity axiom for quasi-linear social choice problems. Social Choice and Welfare, 3(4):297–310, 1986.
  12. Weighted envy-freeness in indivisible item allocation. ACM Transactions on Economics and Computation (TEAC), 9(3):1–39, 2021.
  13. The unreasonable fairness of maximum Nash welfare. ACM Transactions on Economics and Computation (TEAC), 7(3):1–32, 2019.
  14. Picking sequences and monotonicity in weighted fair division. Artif. Intell., 301:103578, 2021.
  15. Weighted fairness notions for indivisible items revisited. In Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 4949–4956. AAAI Press, 2022.
  16. Fair allocation of indivisible goods to asymmetric agents. Journal of Artificial Intelligence Research, 64:1–20, 2019.
  17. Fair enough: Guaranteeing approximate maximin shares. J. ACM, 65(2):8:1–8:27, 2018.
  18. Andreu Mas-Colell. Equilibrium theory with possibly satiated preferences. In M Majumdar, editor, Equilibrium and Dynamics, pages 201–213. Palgrave Macmillan, London, 1992.
  19. Herve Moulin. Axioms of Cooperative Decision Making. Econometric Society Monographs. Cambridge University Press, 1991.
  20. Herve Moulin. An application of the shapley value to fair division with money. Econometrica, 60(6):1331–49, 1992.
  21. Hervé Moulin. Fair division and collective welfare. MIT press, 2004.
  22. Weighted envy-freeness for submodular valuations. CoRR, abs/2209.06437, 2022.
  23. J. H. Reijnierse and Jos A. M. Potters. On finding an envy-free pareto-optimal division. Math. Program., 83:291–311, 1998.
  24. Near exact and envy free cake division. Ars Combinatoria, 45:97–108, 1997.
  25. Erel Segal-Halevi. Competitive equilibrium for almost all incomes: existence and fairness. Autonomous Agents and Multi-Agent Systems, 34(1):1–50, 2020.
  26. Monotonicity and competitive equilibrium in cake-cutting. Economic Theory, 68(2):363–401, September 2019.
  27. Hugo Steinhaus. The problem of fair division. Econometrica, 16(1):101–104, 1948.

Summary

We haven't generated a summary for this paper yet.