Fair allocation of indivisible goods: improvement

DOI10.1287/MOOR.2020.1096zbMATH Open1469.91028OpenAlexW3145017027MaRDI QIDQ4958554FDOQ4958554

Mohammad Ghodsi, Masoud Seddighin, S. Seddighin, Mohammad T. Hajiaghayi, Hadi Yami

Publication date: 14 September 2021

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2020.1096

Recommendations

• Fair enough: guaranteeing approximate maximin shares
• An improved approximation algorithm for maximin shares
• An approximation algorithm for max-min fair allocation of indivisible goods
• Approximation algorithms for computing maximin share allocations
• On maximin share allocations in matroids

zbMATH Keywords

fairnessapproximationmaximin share

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Approximation algorithms (68W25)

Cites Work

• How to Cut A Cake Fairly
• Title not available (Why is that?)
• An efficient polynomial time approximation scheme for load balancing on uniformly related machines
• Approximation Algorithms for Computing Maximin Share Allocations
• Fair Enough
• The fair division of hereditary set systems

Cited In (16)

• Two birds with one stone: fairness and welfare via transfers
• Ordinal Maximin Share Approximation for Goods
• How to allocate hard candies fairly
• On best-of-both-worlds fair-share allocations
• A tight negative example for MMS fair allocations
• Approximating Nash social welfare under binary XOS and binary subadditive valuations
• Reallocation of an infinitely divisible good
• Online max-min fair allocation
• Fair Allocation of Indivisible Goods
• The Price of Connectivity in Fair Division
• Existence of EFX for two additive valuations
• Fair division of indivisible goods: recent progress and open questions
• Fair Allocation of Indivisible Goods to Asymmetric Agents
• Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness
• Fair allocation of indivisible items with conflict graphs
• Approximation Algorithms for the Max-Min Allocation Problem

This page was built for publication: Fair allocation of indivisible goods: improvement

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