Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 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

Fair Division via Quantile Shares (2312.01874v1)

Published 4 Dec 2023 in cs.GT

Abstract: We consider the problem of fair division, where a set of indivisible goods should be distributed fairly among a set of agents with combinatorial valuations. To capture fairness, we adopt the notion of shares, where each agent is entitled to a fair share, based on some fairness criterion, and an allocation is considered fair if the value of every agent (weakly) exceeds her fair share. A share-based notion is considered universally feasible if it admits a fair allocation for every profile of monotone valuations. A major question arises: is there a non-trivial share-based notion that is universally feasible? The most well-known share-based notions, namely proportionality and maximin share, are not universally feasible, nor are any constant approximations of them. We propose a novel share notion, where an agent assesses the fairness of a bundle by comparing it to her valuation in a random allocation. In this framework, a bundle is considered $q$-quantile fair, for $q\in[0,1]$, if it is at least as good as a bundle obtained in a uniformly random allocation with probability at least $q$. Our main question is whether there exists a constant value of $q$ for which the $q$-quantile share is universally feasible. Our main result establishes a strong connection between the feasibility of quantile shares and the classical Erd\H{o}s Matching Conjecture. Specifically, we show that if a version of this conjecture is true, then the $\frac{1}{2e}$-quantile share is universally feasible. Furthermore, we provide unconditional feasibility results for additive, unit-demand and matroid-rank valuations for constant values of $q$. Finally, we discuss the implications of our results for other share notions.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (53)
  1. A rainbow r𝑟ritalic_r-partite version of the Erdős-Ko-Rado theorem. Combin. Probab. Comput., 26(3):321–337, 2017.
  2. Breaking the 3/4343/43 / 4 barrier for approximate maximin share, 2023.
  3. Simplification and improvement of mms approximation. arXiv preprint arXiv:2303.16788, 2023.
  4. The speed of innovation diffusion in social networks. Econometrica, 88(2):569–594, 2020.
  5. Fair allocation of indivisible goods and chores. Autonomous Agents and Multi-Agent Systems, 36:1–21, 2022.
  6. Fair shares: Feasibility, domination and incentives. arXiv preprint arXiv:2205.07519, 2022.
  7. Fair and truthful mechanisms for dichotomous valuations. In Proceedings of the AAAI Conference on Artificial Intelligence, 2021.
  8. The santa claus problem. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pages 31–40, 2006.
  9. Existence and computation of maximin fair allocations under matroid-rank valuations. arXiv preprint arXiv:2012.12710, 2020.
  10. Finding fair and efficient allocations when valuations don’t add up. In Algorithmic game theory, volume 12283 of Lecture Notes in Comput. Sci., pages 32–46. Springer, Cham, 2020.
  11. Competitive division of a mixed manna. Econometrica, 85(6):1847–1871, 2017.
  12. Eric Budish. The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy, 119(6):1061–1103, 2011.
  13. The unreasonable fairness of maximum Nash welfare. ACM Trans. Econ. Comput., 7(3):Art. 12, 32, 2019.
  14. Supermodularity and preferences. Journal of Economic Theory, 144(3):1004–1014, 2009.
  15. On the selection of arbitrators. American Economic Review, 104(11):3434–3458, 2014.
  16. How to cut a cake fairly. The American Mathematical Monthly, 68(1P1):1–17, 1961.
  17. Jack Edmonds. Submodular functions, matroids, and certain polyhedra. In Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969), pages 69–87. Gordon and Breach, New York-London-Paris, 1970.
  18. Cake cutting really is not a piece of cake. In SODA, volume 6, pages 271–278, 2006.
  19. Intersection theorems for systems of finite sets. Quart. J. Math. Oxford Ser. (2), 12:313–320, 1961.
  20. Paul Erdős. A problem on independent r-tuples. Ann. Univ. Sci. Budapest. Eötvös Sect. Math, 8:93–95, 1965.
  21. On maximal paths and circuits of graphs. Acta Mathematica Hungarica, 10(3-4):337–356, 1959.
  22. A note on cake cutting. Discrete Applied Mathematics, 7(3):285–296, 1984.
  23. Uriel Feige. On sums of independent random variables with unbounded variance and estimating the average degree in a graph. SIAM Journal on Computing, 35(4):964–984, 2006.
  24. Improved maximin fair allocation of indivisible items to three agents. arXiv preprint arXiv:2205.05363, 2022.
  25. A tight negative example for mms fair allocations. In International Conference on Web and Internet Economics, pages 355–372. Springer, 2021.
  26. Duncan Karl Foley. Resource allocation and the public sector. Yale University, 1966.
  27. Peter Frankl. Improved bounds for Erdős’ matching conjecture. J. Combin. Theory Ser. A, 120(5):1068–1072, 2013.
  28. Peter Frankl. On the maximum number of edges in a hypergraph with given matching number. Discrete Applied Mathematics, 216:562–581, 2017a.
  29. Peter Frankl. Proof of the Erdős matching conjecture in a new range. Israel Journal of Mathematics, 222:421–430, 2017b.
  30. The Erdős matching conjecture and concentration inequalities. Journal of Combinatorial Theory, Series B, 157:366–400, 2022.
  31. On the maximum number of edges in a triple system not containing a disjoint family of a given size. Combinatorics, Probability and Computing, 21(1-2):141–148, 2012.
  32. On the rainbow matching conjecture for 3-uniform hypergraphs. Sci. China Math., 65(11):2423–2440, 2022.
  33. An improved approximation algorithm for maximin shares. In Proceedings of the 21st ACM Conference on Economics and Computation, pages 379–380, 2020.
  34. Brian Garnett. Small deviations of sums of independent random variables. Journal of Combinatorial Theory, Series A, 169:105119, 2020.
  35. Fair allocation of indivisible goods: Improvements and generalizations. In Proceedings of the 2018 ACM Conference on Economics and Computation, pages 539–556, 2018a.
  36. Fair allocation of indivisible goods: Improvements and generalizations. In Proceedings of the 2018 ACM Conference on Economics and Computation, pages 539–556, 2018b.
  37. Fair allocation of indivisible goods: Beyond additive valuations. Artificial Intelligence, 303:103633, 2022.
  38. The size of a hypergraph and its matching number. Combinatorics, Probability and Computing, 21(3):442–450, 2012.
  39. An algorithmic framework for approximating maximin share allocation of chores. In Proceedings of the 22nd ACM Conference on Economics and Computation, pages 630–631, 2021.
  40. The Nash social welfare function. Econometrica: Journal of the Econometric Society, pages 423–435, 1979.
  41. Andrey Kupavskii. Rainbow version of the Erdős matching conjecture via concentration. Comb. Theory, 3(1):Paper No. 1, 19, 2023.
  42. Fair enough: Guaranteeing approximate maximin shares. Journal of the ACM (JACM), 65(2):1–27, 2018.
  43. László Lovász. Combinatorial problems and exercises. AMS Chelsea Publishing, Providence, RI, second edition, 2007.
  44. A better bound on the size of rainbow matchings. J. Combin. Theory Ser. A, 195:Paper No. 105700, 19, 2023.
  45. On Erdős’ extremal problem on matchings in hypergraphs. Journal of Combinatorial Theory, Series A, 124:178–194, 2014.
  46. On maximal tail probability of sums of nonnegative, independent and identically distributed random variables. Statist. Probab. Lett., 129:12–16, 2017.
  47. Bidding games and efficient allocations. Games and Economic Behavior, 112:166–193, 2018.
  48. John F Nash Jr. The bargaining problem. Econometrica: Journal of the econometric society, pages 155–162, 1950.
  49. Fair enough: Guaranteeing approximate maximin shares. In Proceedings of the fifteenth ACM conference on Economics and computation, pages 675–692, 2014.
  50. Malgorzata Romanowska. A note on the upper bound for the distance in total variation between the binomal and the Poisson distribution. Statistica Neerlandica, 31(3):127–130, 1977.
  51. S. M. Samuels. On a Chebyshev-type inequality for sums of independent random variables. Ann. Math. Statist., 37:248–259, 1966.
  52. Hugo Steinhaus. The problem of fair division. Econometrica, 16:101–104, 1948.
  53. Henry Teicher. An inequality on Poisson probabilities. The Annals of Mathematical Statistics, 26(1):147–149, 1955.
Citations (5)
View on Semantic Scholar

Summary

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now