Abstract
Fair division protocols specify how to split a continuous resource (conventionally represented by a cake) between multiple agents with different preferences. Envy-free protocols ensure no agent prefers any other agent’s allocation to his own. These protocols are complex and manual proofs of their correctness may contain errors. Recently, Bertram and others [5] developed the DSL Slice for describing these protocols and showed how verification of envy-freeness can be reduced to SMT instances in the theory of quantified non-linear real arithmetic. This theory is decidable, but the decision procedure is slow, both in theory and in practice.
We prove that, under reasonable assumptions about the primitive operations used in the protocol, counterexamples to envy-freeness can always be found with bounded integer arithmetic. Building on this result, we construct an embedded DSL for describing cake-cutting protocols in declarative-style C. Using the bounded model-checker CBMC, we reduce verifying envy-freeness of a protocol to checking unsatisfiability of pure SAT instances. This leads to a substantial reduction in verification time when the protocol is unfair.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Audemard, G., Lecoutre, C., Lonca, E.: Proceedings of the 2022 XCSP3 competition. CoRR abs/2209.00917 (2022). https://doi.org/10.48550/arXiv.2209.00917
Aumann, Y., Lang, J., Procaccia, A.D.: Fair division (dagstuhl seminar 16232). Dagstuhl Rep. 6(6), 10–25 (2016). https://doi.org/10.4230/DagRep.6.6.10
Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for any number of agents. In: Dinur, I. (ed.) IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9–11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, pp. 416–427. IEEE Computer Society (2016). https://doi.org/10.1109/FOCS.2016.52
Aziz, H., Mackenzie, S.: A bounded and envy-free cake cutting algorithm. Commun. ACM 63(4), 119–126 (2020). https://doi.org/10.1145/3382129
Bertram, N., Levinson, A., Hsu, J.: Cutting the cake: a language for fair division. CoRR abs/2304.04642 (2023). https://doi.org/10.48550/arXiv.2304.04642
Biere, A., Fleury, M.: Gimsatul, IsaSAT and Kissat entering the SAT competition 2022. In: Balyo, T., Heule, M., Iser, M., Järvisalo, M., Suda, M. (eds.) Proceedings of the SAT Competition 2022 - Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. B-2022-1, pp. 10–11. University of Helsinki (2022). http://hdl.handle.net/10138/359079
Brams, S.J., Pruhs, K., Woeginger, G.J. (eds.): Fair Division, 24.06.–29.06.2007, Dagstuhl Seminar Proceedings, vol. 07261. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany (2007). http://drops.dagstuhl.de/portals/07261/
Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 168–176. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24730-2_15
Corzilius, F., Kremer, G., Junges, S., Schupp, S., Ábrahám, E.: SMT-RAT: an open source C++ toolbox for strategic and parallel SMT solving. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 360–368. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-24318-4_26
Klarreich, E.: How to cut cake fairly and finally eat it too. Quanta Magazine, October 2016. https://www.quantamagazine.org/new-algorithm-solves-cake-cutting-problem-20161006/
Kroening, D., Tautschnig, M.: CBMC – C bounded model checker. In: Ábrahám, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 389–391. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54862-8_26
Lester, M.M.: CoPTIC: constraint programming translated into C. In: Sankaranarayanan, S., Sharygina, N. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2023. LNCS, vol. 13994, pp. 173–191. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-30820-8_13
Lester, M.M.: Crumbs: A DSL for Verifying Envy-Free Cake-Cutting Protocols using Bounded Integer Arithmetic, January 2024. https://doi.org/10.5281/zenodo.10205142
Manthey, N.: Solving summle.net with SAT. In: Balyo, T., Heule, M., Iser, M., Järvisalo, M., Suda, M. (eds.) Proceedings of the SAT Competition 2022 - Solver and Benchmark Descriptions. Department of Computer Science Report Series B, vol. B-2022-1, pp. 70–71. University of Helsinki (2022). http://hdl.handle.net/10138/359079
de Moura, L., Bjørner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78800-3_24
Procaccia, A.D.: Cake cutting: not just child’s play. Commun. ACM 56(7), 78–87 (2013). https://doi.org/10.1145/2483852.2483870
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Lester, M.M. (2023). Cutting the Cake into Crumbs: Verifying Envy-Free Cake-Cutting Protocols Using Bounded Integer Arithmetic. In: Gebser, M., Sergey, I. (eds) Practical Aspects of Declarative Languages. PADL 2024. Lecture Notes in Computer Science, vol 14512. Springer, Cham. https://doi.org/10.1007/978-3-031-52038-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-031-52038-9_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-52037-2
Online ISBN: 978-3-031-52038-9
eBook Packages: Computer ScienceComputer Science (R0)