Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 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 Interval Scheduling of Indivisible Chores (2402.04353v1)

Published 6 Feb 2024 in cs.GT

Abstract: We study the problem of fairly assigning a set of discrete tasks (or chores) among a set of agents with additive valuations. Each chore is associated with a start and finish time, and each agent can perform at most one chore at any given time. The goal is to find a fair and efficient schedule of the chores, where fairness pertains to satisfying envy-freeness up to one chore (EF1) and efficiency pertains to maximality (i.e., no unallocated chore can be feasibly assigned to any agent). Our main result is a polynomial-time algorithm for computing an EF1 and maximal schedule for two agents under monotone valuations when the conflict constraints constitute an arbitrary interval graph. The algorithm uses a coloring technique in interval graphs that may be of independent interest. For an arbitrary number of agents, we provide an algorithm for finding a fair schedule under identical dichotomous valuations when the constraints constitute a path graph. We also show that stronger fairness and efficiency properties, including envy-freeness up to any chore (EFX) along with maximality and EF1 along with Pareto optimality, cannot be achieved.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (41)
  1. Fairness in Scheduling. Journal of Algorithms, 29(2):306–357, 1998.
  2. Fair Division of Indivisible Goods: Recent Progress and Open Questions. Artificial Intelligence, page 103965, 2023.
  3. Fair Allocation of Indivisible Goods and Chores. In Proceedings of the 28th International Joint Conference on Artificial Intelligence, pages 53–59, 2019.
  4. Finding Fair and Efficient Allocations. In Proceedings of the 19th ACM Conference on Economics and Computation, pages 557–574, 2018.
  5. The Price of Quota-Based Diversity in Assignment Problems. ACM Transactions on Economics and Computation, 8(3):1–32, 2020.
  6. On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. In Proceedings of the 24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, 2021.
  7. The Price of Envy-Freeness in Machine Scheduling. Theoretical Computer Science, 613:65–78, 2016.
  8. Almost Envy-Free Allocations with Connected Bundles. Games and Economic Behavior, 131:197–221, 2022.
  9. Matroid Constrained Fair Allocation Problem. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence, volume 33, pages 9921–9922, 2019.
  10. An Algorithmic Approach to Address Course Enrollment Challenges. In Proceedings of the Fourth Symposium on Foundations of Responsible Computing, pages 8:1–8:23, 2023.
  11. Fair Division of a Graph. In Proceedings of the 26th International Joint Conference on Artificial Intelligence, pages 135–141, 2017.
  12. Chore Division on a Graph. Autonomous Agents and Multi-Agent Systems, 33:540–563, 2019.
  13. Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge University Press, 1996.
  14. Handbook of Computational Social Choice. Cambridge University Press, 2016.
  15. Eric Budish. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes. Journal of Political Economy, 119(6):1061–1103, 2011.
  16. Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation. Operations Research, 65(2):314–336, 2017.
  17. The Unreasonable Fairness of Maximum Nash Welfare. ACM Transactions on Economics and Computation, 7(3):12, 2019.
  18. EFX Exists for Three Agents. In Proceedings of the 21st ACM Conference on Economics and Computation, pages 1–19, 2020.
  19. Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica, 85(5):1459–1489, 2023.
  20. On Fair Division under Heterogeneous Matroid Constraints. Journal of Artificial Intelligence Research, 76:567–611, 2023.
  21. How to Fairly Allocate Easy and Difficult Chores. In Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, pages 372–380, 2022.
  22. Duncan Foley. Resource Allocation and the Public Sector. Yale Economic Essays, pages 45–98, 1967.
  23. Puzzle-Math. Viking Press, 1958.
  24. Martin Gardner. aha! Insight. W.H.Freeman and Company, 1978.
  25. Fair and Efficient Allocations of Chores under Bivalued Preferences. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, volume 36, pages 5043–5050, 2022.
  26. New Algorithms for the Fair and Effcient Allocation of Indivisible Chores. In Proceedings of the 32nd International Joint Conference on Artificial Intelligence, pages 2710–2718, 2023.
  27. Spliddit: Unleashing Fair Division Algorithms. ACM SIGecom Exchanges, 13(2):41–46, 2015.
  28. A. Hajnal and E. Szemerédi. Proof of a Conjecture of P. Erdős. In Combinatorial Theory and Its Applications, I-III (Proc. Colloq., Balatonfüred, 1969), volume 4 of Colloq. Math. Soc. János Bolyai, pages 601–623. North-Holland, Amsterdam-London, 1970.
  29. Fair Allocation of Conflicting Items. Autonomous Agents and Multi-Agent Systems, 36, 2022.
  30. Kajibuntan: A House Chore Division App. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 37, pages 16449–16451, 2023.
  31. Fair Scheduling via Iterative Quasi-Uniform Sampling. SIAM Journal on Computing, 49(3):658–680, 2020.
  32. Joseph YT Leung. Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC press, 2004.
  33. Fair Scheduling for Time-Dependent Resources. Advances in Neural Information Processing Systems, 34:21744–21756, 2021.
  34. On Approximately Fair Allocations of Indivisible Goods. In Proceedings of the 5th ACM Conference on Electronic Commerce, pages 125–131, 2004.
  35. Hervé Moulin. Fair Division in the Internet Age. Annual Review of Economics, 11:407–441, 2019.
  36. James Oxley. Matroid Theory. In Handbook of the Tutte Polynomial and Related Topics, pages 44–85. Chapman and Hall/CRC, 2022.
  37. Almost Envy-Freeness with General Valuations. SIAM Journal on Discrete Mathematics, 34(2):1039–1068, 2020.
  38. Warut Suksompong. Constraints in Fair Division. ACM SIGecom Exchanges, 19(2):46–61, 2021.
  39. Martino Traxler. Fair Chore Division for Climate Change. Social Theory and Practice, 28(1):101–134, 2002.
  40. Douglas Brent West. Introduction to Graph Theory, volume 2. Prentice Hall Upper Saddle River, 2001.
  41. Approximately EFX Allocations for Indivisible Chores. In Proceedings of the 31st International Joint Conference on Artificial Intelligence, pages 783–789, 2022.
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