Cited By
View all- Bertram NLai THsu J(2024)Verifying Cake-Cutting, FasterComputer Aided Verification10.1007/978-3-031-65630-9_6(109-129)Online publication date: 24-Jul-2024
Cutting the Cake: A Language for Fair Division
Article No.: 179, Pages 1779 - 1800
Abstract
The fair division literature in economics considers how to divide resources between multiple agents such that the allocation is envy-free: each agent receives their favorite piece. Researchers have developed a variety of fair division protocols for the most standard setting, where the agents want to split a single item, however, the protocols are highly intricate and the proofs of envy-freeness involve tedious case analysis.
We propose Slice, a domain specific language for fair-division. Programs in our language can be converted to logical formulas encoding envy-freeness and other target properties. Then, the constraints can be dispatched to automated solvers. We prove that our constraint generation procedure is sound and complete. We also report on a prototype implementation of Slice, which we have used to automatically check envy-freeness for several protocols from the fair division literature.
References
[1]
Alexander Aiken. 1999. Introduction to Set Constraint-Based Program Analysis. Science of Computer Programming, 35, 2 (1999), 79–111. https://doi.org/10.1016/S0167-6423(99)00007-6
[2]
Haris Aziz and Simon Mackenzie. 2016. A discrete and bounded envy-free cake cutting protocol for any number of agents. In IEEE Symposium on Foundations of Computer Science (FOCS), New Brunswick, New Jersey. 416–427. https://doi.org/10.1109/FOCS.2016.52
[3]
Haris Aziz and Simon Mackenzie. 2016. A discrete and bounded envy-free cake cutting protocol for four agents. In ACM SIGACT Symposium on Theory of Computing (STOC), Cambridge, Massachusetts. 454–464. https://doi.org/10.1145/2897518.2897522
[4]
Alexander Bagnall, Samuel Merten, and Gordon Stewart. 2017. A Library for Algorithmic Game Theory in Ssreflect/Coq. Journal of Formalized Reasoning, 10, 1 (2017), 67–95. https://doi.org/10.6092/issn.1972-5787/7235
[5]
Wei Bai, Emmanuel M. Tadjouddine, Terry R. Payne, and Sheng-Uei Guan. 2013. A Proof-Carrying Code Approach to Certificate Auction Mechanisms. In Formal Aaspects of Component Software (FACS), Nanchang, China (Lecture Notes in Computer Science, Vol. 8348). Springer, 23–40. https://doi.org/10.1007/978-3-319-07602-7_4
[6]
Eric Balkanski, Simina Brânzei, David Kurokawa, and Ariel Procaccia. 2014. Simultaneous Cake Cutting. AAAI Conference on Artificial Intelligence, Québec, Canada, 28, 1 (2014), Jun., https://doi.org/10.1609/aaai.v28i1.8802
[7]
Haniel Barbosa, Clark W. Barrett, Martin Brain, Gereon Kremer, Hanna Lachnitt, Makai Mann, Abdalrhman Mohamed, Mudathir Mohamed, Aina Niemetz, Andres Nötzli, Alex Ozdemir, Mathias Preiner, Andrew Reynolds, Ying Sheng, Cesare Tinelli, and Yoni Zohar. 2022. cvc5: A Versatile and Industrial-Strength SMT Solver. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Munich, Germany (Lecture Notes in Computer Science, Vol. 13243). Springer, 415–442. https://doi.org/10.1007/978-3-030-99524-9_24
[8]
Gilles Barthe, Marco Gaboardi, Emilio Jesús Gallego Arias, Justin Hsu, Aaron Roth, and Pierre-Yves Strub. 2015. Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy. In ACM SIGPLAN–SIGACT Symposium on Principles of Programming Languages (POPL), Mumbai, India. 55–68. https://doi.org/10.1145/2676726.2677000
[9]
Gilles Barthe, Marco Gaboardi, Emilio Jesús Gallego Arias, Justin Hsu, Aaron Roth, and Pierre-Yves Strub. 2016. Computer-Aided Verification in Mechanism Design. In Conference on Web and Internet Economics (WINE), Montréal, Québec (Lecture Notes in Computer Science, Vol. 10123). Springer-Verlag, 273–293. https://doi.org/10.1007/978-3-662-54110-4_20
[10]
Noah Bertram, Alex Levinson, and Justin Hsu. 2023. Cutting the Cake: A Language for Fair Division. arxiv:2304.04642.
[11]
Noah Bertram, Alex Levinson, and Justin Hsu. 2023. Cutting the Cake: A Language for Fair Division. https://doi.org/10.5281/zenodo.7814374
[12]
Steven J Brams, Michael A Jones, and Christian Klamler. 2006. Better Ways to Cut a Cake. Notices of the AMS, 53, 11 (2006), 1314–1321.
[13]
Simina Brânzei, Ioannis Caragiannis, David Kurokawa, and Ariel Procaccia. 2016. An Algorithmic Framework for Strategic Fair Division. AAAI Conference on Artificial Intelligence, Phoenix, Arizona, https://doi.org/10.1609/aaai.v30i1.10042
[14]
Simina Brânzei and Noam Nisan. 2017. The Query Complexity of Cake Cutting. https://doi.org/10.48550/ARXIV.1705.02946
[15]
Marco B Caminati, Manfred Kerber, Christoph Lange, and Colin Rowat. 2015. Sound auction specification and implementation. In ACM SIGecom Conference on Economics and Computation (EC), Portland, Oregon. 547–564. https://doi.org/10.1145/2764468.2764511
[16]
Leonardo Mendonça de Moura and Nikolaj S. Bjørner. 2008. Z3: An Efficient SMT Solver. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Budapest, Hungary (Lecture Notes in Computer Science, Vol. 4963). Springer, 337–340. https://doi.org/10.1007/978-3-540-78800-3_24
[17]
Jean-Yves Girard. 1987. Linear Logic. Theoretical Computer Science, 50 (1987), 1–102. https://doi.org/10.1016/0304-3975(87)90045-4
[18]
K Rustan M Leino. 2010. Dafny: An automatic program verifier for functional correctness. In International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Senegal, Dakar. 348–370. https://doi.org/10.1007/978-3-642-17511-4_20
[19]
Samuel Merten, Alexander Bagnall, and Gordon Stewart. 2018. Verified Learning Without Regret - From Algorithmic Game Theory to Distributed Systems with Mechanized Complexity Guarantees. In European Symposium on Programming (ESOP), Thessaloniki, Greece (Lecture Notes in Computer Science, Vol. 10801). Springer-Verlag, 561–588. https://doi.org/10.1007/978-3-319-89884-1_20
[20]
Jack Robertson and William Webb. 1998. Cake-cutting algorithms: Be fair if you can. AK Peters/CRC Press.
[21]
Erel Segal-Halevi, Avinatan Hassidim, and Yonatan Aumann. 2016. Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting with Free Disposal. ACM Transactions on Algorithms, 13, 1 (2016), 12:1–12:32. https://doi.org/10.1145/2988232
[22]
Nikhil Swamy, Juan Chen, and Ben Livshits. 2013. Verifying Higher-order Programs with the Dijkstra Monad. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Seattle, Washington. ACM. https://doi.org/10.1145/2499370.2491978
[23]
Emina Torlak and Rastislav Bodík. 2013. Growing solver-aided languages with Rosette. In ACM International Symposium on New ideas, new paradigms, and reflections on programming & software (Onward!), Indianapolis, Indiana. 135–152. https://doi.org/10.1145/2509578.2509586
[24]
Gerhard J. Woeginger and Jiří Sgall. 2007. On the complexity of cake cutting. Discrete Optimization, 4, 2 (2007), 213–220. issn:1572-5286 https://doi.org/10.1016/j.disopt.2006.07.003
Index Terms
- Cutting the Cake: A Language for Fair Division
Recommendations
Equilibrium analysis in cake cutting
AAMAS '13: Proceedings of the 2013 international conference on Autonomous agents and multi-agent systemsCake cutting is a fundamental model in fair division; it represents the problem of fairly allocating a heterogeneous divisible good among agents with different preferences. The central criteria of fairness are proportionality and envy-freeness, and many ...
Truthful fair division
SAGT'10: Proceedings of the Third international conference on Algorithmic game theoryWe address the problem of fair division, or cake cutting, with the goal of finding truthful mechanisms. In the case of a general measure space ("cake") and non-atomic, additive individual preference measures - or utilities - we show that there exists a ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2023 Owner/Author.
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 06 June 2023
Published in PACMPL Volume 7, Issue PLDI
Check for updates
Badges
Author Tags
Qualifiers
- Research-article
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 471Total Downloads
- Downloads (Last 12 months)351
- Downloads (Last 6 weeks)54
Reflects downloads up to 13 Nov 2024
Other Metrics
Citations
Cited By
View all- Bertram NLai THsu J(2024)Verifying Cake-Cutting, FasterComputer Aided Verification10.1007/978-3-031-65630-9_6(109-129)Online publication date: 24-Jul-2024
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in