Approximately EFX allocations for indivisible chores
Authors:
- Shengwei ZhouSZShengwei Zhou
- Xiaowei WuXWXiaowei Wu
- 7 November 2023
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 326
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Science and Technology Development Fund
- Fundo para o Desenvolvimento das Ciências e da Tecnologia (0014/2022/AFJ, 0143/2020/A3, SKL-IOTSC-2021-2023)
This publication has 11 references indexed in Scilit:
- Algorithmic fair allocation of indivisible itemsACM SIGecom Exchanges, 2022
- Maximum Nash welfare and other stories about EFXTheoretical Computer Science, 2021
- Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle eliminationTheoretical Computer Science, 2020
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocationOperations Research Letters, 2020
- Almost Envy-Freeness with General ValuationsSIAM Journal on Discrete Mathematics, 2020
- The Unreasonable Fairness of Maximum Nash WelfareACM Transactions on Economics and Computation, 2019
- Fair Division in the Internet AgeAnnual Review of Economics, 2019
- The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal IncomesJournal of Political Economy, 2011
- Rental Harmony: Sperner's Lemma in Fair DivisionThe American Mathematical Monthly, 1999
- Splitting necklacesAdvances in Mathematics, 1987