Allocating Chores with Restricted Additive Costs: Achieving EFX, MMS, and Efficiency Simultaneously - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Zehan Lin, Xiaowei Wu 0001, Shengwei Zhou 0002. Allocating Chores with Restricted Additive Costs: Achieving EFX, MMS, and Efficiency Simultaneously. In Hakim Hacid, Yoelle Maarek, Francesco Bonchi, Ido Guy, Emine Yilmaz, editors, Proceedings of the ACM Web Conference 2026, WWW 2026, Dubai, United Arab Emirates, originally scheduled for April 13-17, 2026, rescheduled for June 29 - July 3, 2026. pages 146-156, ACM, 2026. [doi]

The following publications are possibly variants of this publication:

Fairness criteria for allocating indivisible chores: connections and efficienciesAnkang Sun, Bo Chen 0002, Xuan Vinh Doan. AAMAS, 37(2):39, October 2023. [doi]

Approximately EFX allocations for indivisible choresShengwei Zhou 0002, Xiaowei Wu 0001. ai, 326:104037, January 2024. [doi]

Approximately EFX Allocations for Indivisible ChoresShengwei Zhou 0002, Xiaowei Wu 0001. IJCAI 2022: 783-789 [doi]

All-but-one MMS Allocation for ChoresJiawei Qiu, Xiaowei Wu 0001, Cong Zhang 0008, Shengwei Zhou 0002. WWW 2026: 157-168 [doi]

Approximately EFX and fPO Allocations for Bivalued ChoresZehan Lin, Xiaowei Wu 0001, Shengwei Zhou 0002. IJCAI 2025: 3952-3960 [doi]

On the existence of EFX (and Pareto-optimal) allocations for binary choresBiaoshuai Tao, Xiaowei Wu 0001, Ziqi Yu, Shengwei Zhou 0002. TCS, 1042:115248, 2025. [doi]

On the Existence of EFX (and Pareto-Optimal) Allocations for Binary ChoresBiaoshuai Tao, Xiaowei Wu 0001, Ziqi Yu, Shengwei Zhou 0002. faw 2025: 33-52 [doi]

EFX allocations for indivisible chores: Matching-based approachYusuke Kobayashi 0001, Ryoga Mahara, Souta Sakamoto. TCS, 1026:115010, 2025. [doi]

EFX Allocations for Indivisible Chores: Matching-Based ApproachYusuke Kobayashi 0001, Ryoga Mahara, Souta Sakamoto. sagt 2023: 257-270 [doi]

runs on WebDSL