1 paper
Arnav Mehra, Alexandros Psomas
We consider the classic cake-cutting problem of producing fair allocations for n agents, in the Robertson-Webb query model. In this model, it is known that: (i) proportional allo…