Expand the shares together: envy-free mechanisms with a small number of cuts

DOI10.1007/s00453-018-0500-zzbMath1426.91148OpenAlexW2886807769MaRDI QIDQ1739119

Reza Alijani, Majid Farhadi, Mohammad Ghodsi, Ahmad S. Tajik, Masoud Seddighin

Publication date: 25 April 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-018-0500-z

zbMATH Keywords

fairnessapproximationenvy-freemechanism designcake cutting

Mathematics Subject Classification ID

Other game-theoretic models (91A40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (6)

Truthful fair division without free disposal ⋮ Fair multi-cake cutting ⋮ On existence of truthful fair cake cutting mechanisms ⋮ Contiguous Cake Cutting: Hardness Results and Approximation Algorithms ⋮ 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

Cites Work

• Unnamed Item
• Truth, justice, and cake cutting
• Envy-free cake divisions cannot be found by finite protocols
• Expand the shares together: envy-free mechanisms with a small number of cuts
• Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
• Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations
• How to Cut a Cake Fairly
• An Envy-Free Cake Division Protocol
• Algorithmic Solutions for Envy-Free Cake Cutting
• Cake Cutting Algorithms
• A discrete and bounded envy-free cake cutting protocol for four agents

This page was built for publication: Expand the shares together: envy-free mechanisms with a small number of cuts