Fair division of indivisible goods: recent progress and open questions
From MaRDI portal
Publication:6136107
DOI10.1016/j.artint.2023.103965arXiv2208.08782MaRDI QIDQ6136107
Hervé Moulin, Xiaowei Wu, Bo Li, Georgios Amanatidis, Georgios Birmpas, Haris Aziz, Aris Filos-Ratsikas, Alexandros A. Voudouris
Publication date: 28 August 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.08782
68Txx: Artificial intelligence
Related Items
Approximately EFX allocations for indivisible chores, Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Earning limits in Fisher markets with spending-constraint utilities
- The efficiency of fair division
- Approximation algorithms for scheduling unrelated parallel machines
- Optimal semi-online algorithms for machine covering
- Welfare bounds in the fair division problem
- On the fair division of a heterogeneous commodity
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- On maximin share allocations in matroids
- Approximate maximin shares for groups of agents
- Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness
- A tight negative example for MMS fair allocations
- Computing envy-freeable allocations with limited subsidies
- Almost envy-freeness for groups: improved bounds via discrepancy theory
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
- Almost envy-freeness in group resource allocation
- The price of fairness for indivisible goods
- Fair division of mixed divisible and indivisible goods
- An improved approximation algorithm for maximin shares
- Maximin share guarantee for goods with positive externalities
- Democratic fair allocation of indivisible goods
- Fair division with subsidy
- Dividing bads under additive utilities
- Maximum Nash welfare and other stories about EFX
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
- Fair allocation of indivisible goods: beyond additive valuations
- Computing fair and efficient allocations with few utility values
- The vigilant eating rule: a general approach for probabilistic economic design with constraints
- Simultaneously achieving ex-ante and ex-post fairness
- Optimal bounds on the price of fairness for indivisible goods
- Fair division with binary valuations: one rule to rule them all
- Extending the characterization of maximum Nash welfare
- The Santa Claus problem
- No Agent Left Behind: Dynamic Fair Division of Multiple Resources
- Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design
- The Price of Fairness
- On Low-Envy Truthful Allocations
- How to Cut A Cake Fairly
- The Impossibility of Bayesian Group Decision Making with Separate Aggregation of Beliefs and Values
- Approximation Algorithms for Computing Maximin Share Allocations
- Fair Enough
- Approximating the Nash Social Welfare with Indivisible Items
- Fair Allocation of Indivisible Goods to Asymmetric Agents
- Competitive Division of a Mixed Manna
- A Little Charity Guarantees Almost Envy-Freeness
- Fair Allocation of Indivisible Goods: Improvement
- Closing Gaps in Asymptotic Fair Division
- Fairly Allocating Many Goods with Few Queries
- Competitive Equilibrium with Indivisible Goods and Generic Budgets
- A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching
- Almost Envy-Freeness with General Valuations
- When Do Envy-Free Allocations Exist?
- Fair Allocation of Indivisible Goods
- Cake Cutting Algorithms
- Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
- A discrete and bounded envy-free cake cutting protocol for four agents
- Random Matching Under Dichotomous Preferences
- Sur la division pragmatique
- On-line machine covering
- A new solution to the random assignment problem.
- On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
