Fair allocation of indivisible goods: improvement
From MaRDI portal
Publication:4958554
DOI10.1287/MOOR.2020.1096zbMATH Open1469.91028OpenAlexW3145017027MaRDI QIDQ4958554FDOQ4958554
Authors: Mohammad Ghodsi, Masoud Seddighin, S. Seddighin, Hadi Yami, Mohammad T. Hajiaghayi 
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
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: guaranteeing approximate maximin shares
- The fair division of hereditary set systems
Cited In (29)
- An approximation algorithm for max-min fair allocation of indivisible goods
- Two birds with one stone: fairness and welfare via transfers
- Ordinal Maximin Share Approximation for Goods
- How to allocate hard candies fairly
- Fair allocation of indivisible goods with minimum inequality or minimum envy
- Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
- On best-of-both-worlds fair-share allocations
- Fair enough: guaranteeing approximate maximin shares
- Fairness and rank-weighted utilitarianism in resource allocation
- Worst case compromises in matroids with applications to the allocation of indivisible goods
- 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
- Optimal bounds on the price of fairness for indivisible goods
- An improved approximation algorithm for maximin shares
- Online max-min fair allocation
- Obtaining a proportional allocation by deleting items
- Obtaining a proportional allocation by deleting items
- Fair Allocation of Indivisible Goods
- Existence of EFX for two additive valuations
- Fair division of indivisible goods: recent progress and open questions
- Improving Nash social welfare approximations of indivisible goods
- 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
- The price of connectivity in fair division
- Maximin fair allocation of indivisible items under cost utilities
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
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)
