Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Haris Aziz 0001, Bo Li, Xiaowei Wu 0001. Approximate and strategyproof maximin share allocation of chores with ordinal preferences. Math. Program., 203(1):319-345, January 2024. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Strategyproof and Approximately Maxmin Fair Share Allocation of ChoresHaris Aziz 0001, Bo Li 0037, Xiaowei Wu. IJCAI 2019: 60-66 [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] Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric AgentsTianze Wei, Bo Li, Minming Li. IJCAI 2023: 2897-2905 [doi]
The following publications are possibly variants of this publication: