Envy-free cake-cutting for four agents
A Hollender, A Rubinstein - 2023 IEEE 64th Annual Symposium …, 2023 - ieeexplore.ieee.org
In the envy-free cake-cutting problem we are given a resource, usually called a cake and
represented as the 0,1 interval, and a set of n agents with heterogeneous preferences over …
represented as the 0,1 interval, and a set of n agents with heterogeneous preferences over …
[HTML][HTML] Approximate envy-freeness in graphical cake cutting
SM Yuen, W Suksompong - Discrete Applied Mathematics, 2024 - Elsevier
We study the problem of fairly allocating a divisible resource in the form of a graph, also
known as graphical cake cutting. Unlike for the canonical interval cake, a connected envy …
known as graphical cake cutting. Unlike for the canonical interval cake, a connected envy …
Contiguous Allocation of Indivisible Items on a Path
We study the problem of allocating indivisible items on a path among agents. The objective
is to find a fair and efficient allocation in which each agent's bundle forms a contiguous block …
is to find a fair and efficient allocation in which each agent's bundle forms a contiguous block …
Connectedness in fair division of circle and star cakes between two agents with unequal entitlements
J Hanke, A Heggison, AR Pires - arXiv preprint arXiv:2312.12260, 2023 - arxiv.org
Austin's moving knife procedure is used to divide a cake equitably between two agents:
each agent believes that they received exactly half of the cake. This short note deals with the …
each agent believes that they received exactly half of the cake. This short note deals with the …