Fair and efficient cake division with connected pieces

DOI10.1007/978-3-030-35389-6_5zbMath1435.91103arXiv1907.11019OpenAlexW2989818063MaRDI QIDQ776236

Siddharth Barman, Nidhi Rathi, Rachitesh Kumar, Eshwar Ram Arunachaleswaran

Publication date: 30 June 2020

Full work available at URL: https://arxiv.org/abs/1907.11019

zbMATH Keywords

fair divisionenvy-freenessNash social welfare

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Welfare economics (91B15)

Related Items (6)

Consensus-Halving: Does It Ever Get Easier? ⋮ Fair multi-cake cutting ⋮ Two birds with one stone: fairness and welfare via transfers ⋮ Contiguous Cake Cutting: Hardness Results and Approximation Algorithms ⋮ Mind the gap: cake cutting with separation ⋮ Fair Cake Division Under Monotone Likelihood Ratios

Cites Work

• Unnamed Item
• Unnamed Item
• The efficiency of fair division
• Envy-free cake divisions cannot be found by finite protocols
• Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
• Rental Harmony: Sperner's Lemma in Fair Division
• Approximating the Throughput of Multiple Machines in Real-Time Scheduling
• Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations
• The Bargaining Problem
• Proof verification and the hardness of approximation problems
• Consensus of Subjective Probabilities: The Pari-Mutuel Method
• The Nash Social Welfare Function
• How to Cut a Cake Fairly
• Interval selection: Applications, algorithms, and lower bounds
• Algorithmic Solutions for Envy-Free Cake Cutting
• Fully Polynomial-Time Approximation Schemes for Fair Rent Division
• A discrete and bounded envy-free cake cutting protocol for four agents

This page was built for publication: Fair and efficient cake division with connected pieces