Papers for

online dispute resolution platforms

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Envy free cake cutting method works for any number of people

Cutting a Cake For Human Consumption: An Elementary $n$-agent Cake Cutting Protocol

Abstract: We give a bounded envy-free cake-cutting protocol for any number $n$ of agents in the Robertson--Webb model, with a short, self-contained, and elementary correctness proof. The protocol uses $2^{O(n \log n)}$ queries. Most ingredients are already known and well understood in the fair division literature; our main contribution is a simpler organization of these ideas into a protocol whose complete description and proof fit in a few pages.

Wed 21 OctComputer Science and Game Theory
The gist
The problem is how to divide a cake fairly among any number of people so no one feels jealous of another's share. The authors provide a clear step-by-step method that guarantees everyone is satisfied without envy, using a limited number of questions. They base their approach on previously known ideas but organize them in a simpler way with a short proof. This makes the cake-cutting process easier to understand and apply.
Open → 2610.30370v1