Fairly Allocating Many Goods with Few Queries

DOI10.1137/20M1313349zbMath1466.91143arXiv1807.11367OpenAlexW3154381162MaRDI QIDQ4986810

Warut Suksompong, Hoon Oh, Ariel D. Procaccia

Publication date: 28 April 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsfair divisionquery complexityenvy-freeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (5)

Almost Envy-Freeness with General Valuations ⋮ Fair division of indivisible goods: recent progress and open questions ⋮ The price of fairness for indivisible goods ⋮ The Price of Connectivity in Fair Division ⋮ Consensus Halving for Sets of Items

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of almost envy-free allocations
• An improved envy-free cake cutting protocol for four agents
• Almost envy-freeness in group resource allocation
• How to Cut a Cake Fairly
• Approximation Algorithms for Computing Maximin Share Allocations
• Fair Enough
• Fair Allocation of Indivisible Goods to Asymmetric Agents
• An Envy-Free Cake Division Protocol
• Algorithmic Solutions for Envy-Free Cake Cutting
• Almost Envy-Freeness with General Valuations
• Communication Complexity of Discrete Fair Division
• A discrete and bounded envy-free cake cutting protocol for four agents
• Fairly allocating contiguous blocks of indivisible items
• Cake cutting really is not a piece of cake

This page was built for publication: Fairly Allocating Many Goods with Few Queries