Cutting the Cake into Crumbs: Verifying Envy-Free Cake-Cutting Protocols Using Bounded Integer Arithmetic

Martin Mariusz Lester. Cutting the Cake into Crumbs: Verifying Envy-Free Cake-Cutting Protocols Using Bounded Integer Arithmetic. In Martin Gebser, Ilya Sergey, editors, Practical Aspects of Declarative Languages - 26th International Symposium, PADL 2024, London, UK, January 15-16, 2024, Proceedings. Volume 14512 of Lecture Notes in Computer Science, pages 100-115, Springer, 2024. [doi]

Abstract

Abstract is missing.