2000 character limit reached
Fair Division of Multi-layered Cakes (2208.00726v2)
Published 1 Aug 2022 in cs.AI and cs.GT
Abstract: We consider multi-layered cake cutting in order to fairly allocate numerous divisible resources (layers of cake) among a group of agents under two constraints: contiguity and feasibility. We first introduce a new computational model in a multi-layered cake named ``a pair of knives''. Then, we show the existence of an exact multi-allocation for two agents and two layers using the new computational model. We demonstrate the computation procedure of a feasible and contiguous proportional multi-allocation over a three-layered cake for more than three agents. Finally, we develop a technique for computing proportional allocations for any number $n\geq 2a3$ of agents and $2a3$ layers, where $a$ is any positive integer.
- Fair Division: From cake-cutting to dispute resolution. Cambridge University Press, 1996.
- Hervé Moulin. Fair division and collective welfare. MIT press, 2004.
- Cake-cutting algorithms: Be fair if you can. CRC Press, 1998.
- Handbook of computational social choice. Cambridge University Press, 2016.
- Cake cutting really is not a piece of cake. ACM Transactions on Algorithms (TALG), 7(4):1–12, 2011.
- The efficiency of fair division with connected pieces. ACM Transactions on Economics and Computation (TEAC), 3(4):1–16, 2015.
- The efficiency of fair division. Theory of Computing Systems, 50:589–610, 2012.
- William Thomson. Children crying at birthday parties. why? Economic Theory, 31(3):501–521, 2007.
- Ariel D Procaccia. Cake cutting: Not just child’s play. Communications of the ACM, 56(7):78–87, 2013.
- The query complexity of cake cutting. Advances in Neural Information Processing Systems, 35:37905–37919, 2022.
- An envy-free cake division protocol. The American Mathematical Monthly, 102(1):9–18, 1995.
- Francis Edward Su. Rental harmony: Sperner’s lemma in fair division. The American mathematical monthly, 106(10):930–942, 1999.
- Walter Stromquist. How to cut a cake fairly. The American Mathematical Monthly, 87(8):640–644, 1980.
- How to cut a cake fairly. The American Mathematical Monthly, 68(1P1):1–17, 1961.
- A discrete and bounded envy-free cake cutting protocol for four agents. In Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, pages 454–464, 2016.
- A discrete and bounded envy-free cake cutting protocol for any number of agents. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pages 416–427. IEEE, 2016.
- A bounded and envy-free cake cutting algorithm. Commun. ACM, 63(4):119–126, 2020.
- A note on cake cutting. Discrete Applied Mathematics, 7(3):285–296, 1984.
- Walter Stromquist. Envy-free cake divisions cannot be found by finite protocols. the electronic journal of combinatorics, 15(1):R11, 2008.
- Fair division of time: Multi-layered cake cutting. In International Joint Conference on Artificial Intelligence, 2020.
- The unreasonable fairness of maximum nash welfare. ACM Transactions on Economics and Computation (TEAC), 7(3):1–32, 2019.
- Ariel D Procaccia. Thou shalt covet thy neighbor’s cake. In Twenty-First International Joint Conference on Artificial Intelligence, 2009.
- Algorithmic solutions for envy-free cake cutting. Operations Research, 60(6):1461–1476, 2012.
- Julius B Barbanel. The geometry of efficient fair division. Cambridge University Press, 2005.
- Computing socially-efficient cake divisions. AAMAS, 2012.
- Envy-free division of multi-layered cakes. In International Conference on Web and Internet Economics, pages 504–521. Springer, 2021.
- Envy-free two-player m-cake and three-player two-cake divisions. Operations Research Letters, 41(6):607–610, 2013.
- Fair division with multiple pieces. Discrete Applied Mathematics, 283:115–122, 2020.
- Two-player envy-free multi-cake division. Mathematical Social Sciences, 59(1):26–37, 2010.
- A Keith Austin. Sharing a cake. The Mathematical Gazette, 66(437):212–215, 1982.
- Noga Alon. Splitting necklaces. Advances in Mathematics, 63(3):247–253, 1987.