On best-of-both-worlds fair-share allocations

DOI10.1007/978-3-031-22832-2_14arXiv2102.04909MaRDI QIDQ6167252

Tomer Ezra, Moshe Babaioff

Publication date: 4 August 2023

Published in: Web and Internet Economics (Search for Journal in Brave)

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

zbMATH Keywords

fair divisionmaximin sharebest-of-both-worldstruncated proportional share

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

On best-of-both-worlds fair-share allocations

Cites Work

• Approximation algorithms for scheduling unrelated parallel machines
• A tight negative example for MMS fair allocations
• An improved approximation algorithm for maximin shares
• Efficient reallocation under additive and responsive preferences
• Simultaneously achieving ex-ante and ex-post fairness
• Fair division with binary valuations: one rule to rule them all
• Budgeted Allocations in the Full-Information Setting
• On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
• Approximation Algorithms for Computing Maximin Share Allocations
• Fair Enough
• Fair Allocation of Indivisible Goods: Improvement
• A new solution to the random assignment problem.
• On best-of-both-worlds fair-share allocations

This page was built for publication: On best-of-both-worlds fair-share allocations