Algorithmic Solutions for Envy-Free Cake Cutting
From MaRDI portal
Publication:4909115
DOI10.1287/opre.1120.1116zbMath1262.91016OpenAlexW1997961920MaRDI QIDQ4909115
Qi Qi, Amin Saberi, Xiaotie Deng
Publication date: 12 March 2013
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/75e2846f0172cd5826b176776cea01139f42977a
Related Items (24)
Consensus-Halving: Does It Ever Get Easier? ⋮ Envy-free division of multi-layered cakes ⋮ Dynamic Fair Resource Division ⋮ On existence of truthful fair cake cutting mechanisms ⋮ Contiguous Cake Cutting: Hardness Results and Approximation Algorithms ⋮ The Hairy Ball problem is PPAD-complete ⋮ Expand the shares together: envy-free mechanisms with a small number of cuts ⋮ Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts ⋮ The efficiency of fair division ⋮ Unnamed Item ⋮ Envy-free cake division without assuming the players prefer nonempty pieces ⋮ Assessing risky weighting functions for positive and negative binary gambles using the logarithmic derivative function ⋮ Envy-Free Division of Land ⋮ Cutting a Cake for Five People ⋮ Fairly Allocating Many Goods with Few Queries ⋮ Fair and efficient cake division with connected pieces ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Almost envy-free allocations with connected bundles ⋮ The complexity of finding fair independent sets in cycles ⋮ Fully Polynomial-Time Approximation Schemes for Fair Rent Division ⋮ Two's company, three's a crowd: consensus-halving for a constant number of agents ⋮ The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich ⋮ Fair Cake Division Under Monotone Likelihood Ratios ⋮ Consensus Halving for Sets of Items
This page was built for publication: Algorithmic Solutions for Envy-Free Cake Cutting
