Almost proportional allocations of indivisible chores: computation, approximation and efficiency
From MaRDI portal
Publication:6566645
DOI10.1016/J.ARTINT.2024.104118zbMATH Open1542.68195MaRDI QIDQ6566645FDOQ6566645
Authors: Haris Aziz, Bo Li, Hervé Moulin, Xiaowei Wu, Xinran Zhu 
Publication date: 3 July 2024
Published in: Artificial Intelligence (Search for Journal in Brave)
Recommendations
Analysis of algorithms (68W40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Approximation algorithms (68W25) Agent technology and artificial intelligence (68T42)
Cites Work
- The price of fairness
- A complete anytime algorithm for number partitioning
- Title not available (Why is that?)
- Almost envy-freeness with general valuations
- Fair division of indivisible goods: recent progress and open questions
- Dividing connected chores fairly
- Fair enough: guaranteeing approximate maximin shares
- Optimal bounds on the price of fairness for indivisible goods
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
- Fair Allocation of Indivisible Goods to Asymmetric Agents
- Competitive equilibrium with indivisible goods and generic budgets
- Allocating contiguous blocks of indivisible chores fairly
- Maximum Nash welfare and other stories about EFX
- A tight negative example for MMS fair allocations
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
- On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
- Breaking the 3/4 barrier for approximate maximin share
Cited In (1)
This page was built for publication: Almost proportional allocations of indivisible chores: computation, approximation and efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566645)
