Cutting the Cake into Crumbs: Verifying Envy-Free Cake-Cutting Protocols Using Bounded Integer Arithmetic
MM Lester - International Symposium on Practical Aspects of …, 2024 - Springer
Fair division protocols specify how to split a continuous resource (conventionally
represented by a cake) between multiple agents with different preferences. Envy-free …
represented by a cake) between multiple agents with different preferences. Envy-free …
Verifying Cake-Cutting, Faster
N Bertram, T Lai, J Hsu - arXiv preprint arXiv:2405.14068, 2024 - arxiv.org
Envy-free cake-cutting protocols procedurally divide an infinitely divisible good among a set
of agents so that no agent prefers another's allocation to their own. These protocols are …
of agents so that no agent prefers another's allocation to their own. These protocols are …
[PDF][PDF] A Complete Bibliography of Proceedings of the ACM on Programming Languages (PACMPL)
NHF Beebe - 2024 - netlib.sandia.gov
Abstract [BGMW20, BCE+23, BGG+20, Cou24, EDM23, GFV23, KEH23, Lem23, MZB24,
MFSV23, PWD24, YLY23, BCD22, CDG22, Cra19, FSSW22, FS22, JTD21, KMD+22 …
MFSV23, PWD24, YLY23, BCD22, CDG22, Cra19, FSSW22, FS22, JTD21, KMD+22 …