Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fair Division of Indivisible Goods with Comparison-Based Queries (2404.18133v1)

Published 28 Apr 2024 in cs.GT

Abstract: We study the problem of fairly allocating $m$ indivisible goods to $n$ agents, where agents may have different preferences over the goods. In the traditional setting, agents' valuations are provided as inputs to the algorithm. In this paper, we study a new comparison-based query model where the algorithm presents two bundles of goods to an agent and the agent responds by telling the algorithm which bundle she prefers. We investigate the query complexity for computing allocations with several fairness notions including proportionality up to one good (PROP1), envy-freeness up to one good (EF1), and maximin share (MMS). Our main result is an algorithm that computes an allocation satisfying both PROP1 and $\frac12$-MMS within $O(\log m)$ queries with a constant number of $n$ agents. For identical and additive valuation, we present an algorithm for computing an EF1 allocation within $O(\log m)$ queries with a constant number of $n$ agents. To complement the positive results, we show that the lower bound of the query complexity for any of the three fairness notions is $\Omega(\log m)$ even with two agents.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. Breaking the 3/4343/43 / 4 barrier for approximate maximin share. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 74–91, 2024.
  2. Fair division of indivisible goods: Recent progress and open questions. Artificial Intelligence, 322:103965, 2023.
  3. A discrete and bounded envy-free cake cutting protocol for four agents. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC), pages 454–464, 2016a.
  4. A discrete and bounded envy-free cake cutting protocol for any number of agents. In Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 416–427, 2016b.
  5. Fair allocation of indivisible goods and chores. Autonomous Agents and Multi-Agent Systems, 36(1):3:1–3:21, 2022.
  6. Possible fairness for allocating indivisible resources. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 197–205, 2023.
  7. Dynamic fair division with partial information. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS), pages 3703–3715, 2022.
  8. Almost envy-free allocations with connected bundles. Games and Economic Behavior, 131:197–221, 2022.
  9. An envy-free cake division protocol. The American Mathematical Monthly, 102(1):9–18, 1995.
  10. Communication complexity of cake cutting. In Proceedings of the ACM Conference on Economics and Computation (EC), page 525, 2019.
  11. The query complexity of cake cutting. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS), pages 37905–37919, 2022.
  12. On the complexity of maximizing social welfare within fair allocations of indivisible goods. arXiv preprint arXiv:2205.14296, 2022.
  13. Eric Budish. The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy, 119(6):1061–1103, 2011.
  14. The unreasonable fairness of maximum Nash welfare. ACM Transactions on Economics and Computation (TEAC), 7(3):1–32, 2019.
  15. On the computability of equitable divisions. Discrete Optimization, 9(4):249–257, 2012.
  16. EFX exists for three agents. Journal of the ACM (JACM), 2023. Forthcoming.
  17. Fair public decision making. In Proceedings of the ACM Conference on Economics and Computation (EC), pages 629–646, 2017.
  18. How to cut a cake fairly. The American Mathematical Monthly, 68(1P1):1–17, 1961.
  19. Cake cutting really is not a piece of cake. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 271–278, 2006.
  20. A note on cake cutting. Discrete Applied Mathematics, 7(3):285–296, 1984.
  21. Duncan Karl Foley. Resource allocation and the public sector. Yale Economics Essays, 7(1):45–98, 1967.
  22. Fair allocation of indivisible goods: Improvement. Mathematics of Operations Research, 46(3):1038–1053, 2021.
  23. Philip Hall. On representatives of subsets. Classic Papers in Combinatorics, pages 58–62, 1987.
  24. Fair and efficient resource allocation with partial information. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 224–230, 2021.
  25. How to cut a cake before the party ends. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pages 555–561, 2013.
  26. On approximately fair allocations of indivisible goods. In Proceedings of the ACM Conference on Electronic Commerce (EC), pages 125–131, 2004.
  27. Fairly allocating many goods with few queries. SIAM Journal on Discrete Mathematics, 35(2):788–813, 2021.
  28. Almost envy-freeness with general valuations. SIAM Journal on Discrete Mathematics, 34(2):1039–1068, 2020a.
  29. Communication complexity of discrete fair division. SIAM Journal on Computing, 49(1):206–243, 2020b.
  30. Ariel D Procaccia. Thou shalt covet thy neighbor’s cake. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pages 239–244, 2009.
  31. Fair enough: Guaranteeing approximate maximin shares. In Proceedings of the ACM conference on Economics and computation (EC), pages 675–692, 2014.
  32. A lower bound for equitable cake cutting. In Proceedings of the ACM Conference on Economics and Computation (EC), pages 479–495, 2017.
  33. Cake-Cutting Algorithms: Be Fair If You Can. Peters/CRC Press, 1998.
  34. Hugo Steinhaus. The problem of fair division. Econometrica, 16(1):101–104, 1948.
  35. Hugo Steinhaus. Sur la division pragmatique. Econometrica, 17:315–319, 1949.
  36. Walter Stromquist. How to cut a cake fairly. The American Mathematical Monthly, 87(8):640–644, 1980.
  37. Walter Stromquist. Envy-free cake divisions cannot be found by finite protocols. Electronic Journal of Combinatorics, 15(1):#R11, 2008.
  38. Hal R Varian. Equity, envy, and efficiency. Journal of Economic Theory, 9(1):63–91, 1974.
Citations (2)
View on Semantic Scholar

Summary

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

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

Tweets