Algorithmic solutions for envy-free cake cutting

DOI10.1287/OPRE.1120.1116zbMATH Open1262.91016OpenAlexW1997961920MaRDI QIDQ4909115FDOQ4909115

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1962847
• A note on envy-free cake cutting with polynomial valuations
• On finding an envy-free Pareto-optimal division
• Fair multi-cake cutting
• Cutting a Cake for Five People

zbMATH Keywords

fixed pointFPTASenvy-freefair divisioncake cuttingPPAD

Mathematics Subject Classification ID

Applications of game theory (91A80) Noncooperative games (91A10)

Cited In (31)

• Dynamic Fair Resource Division
• Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
• On existence of truthful fair cake cutting mechanisms
• Expand the shares together: envy-free mechanisms with a small number of cuts
• The complexity of cake cutting with unequal shares
• Fully Polynomial-Time Approximation Schemes for Fair Rent Division
• Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm
• Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts
• The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
• Consensus Halving for Sets of Items
• Fairly Allocating Many Goods with Few Queries
• Assessing risky weighting functions for positive and negative binary gambles using the logarithmic derivative function
• Consensus-Halving: Does It Ever Get Easier?
• A discrete and bounded locally envy-free cake cutting protocol on trees
• Envy-free division of multi-layered cakes
• Title not available (Why is that?)
• A note on envy-free cake cutting with polynomial valuations
• Envy-Free Division of Land
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• The efficiency of fair division
• Fair Cake Division Under Monotone Likelihood Ratios
• Fair and efficient cake division with connected pieces
• Logarithmic algorithms for fair division problems
• Cutting a Cake for Five People
• Meta-Envy-Free Cake-Cutting Protocols
• Almost envy-free allocations with connected bundles
• Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
• Envy-free cake division without assuming the players prefer nonempty pieces
• The complexity of finding fair independent sets in cycles
• The Hairy Ball problem is PPAD-complete
• Two's company, three's a crowd: consensus-halving for a constant number of agents

This page was built for publication: Algorithmic solutions for envy-free cake cutting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909115)