We study approximate EFX allocations of indivisible chores under nonnegative additive costs. Exact EFX allocations need not exist in general. We develop a polynomial-time algorithm that computes a complete $(3+\varepsilon)$-EFX allocation for any rational $0<\varepsilon\leq1$, improving the previous approximation guara...
G. Qin, Qi-Zhi Fang, Min-Ming Li et al.· 0 citations
The house allocation problem is a classical one-sided matching problem that concerns the assignment of a set of $m$ houses to $n$ agents according to their preferences, where each agent is assigned exactly one house. Among the various objectives studied in this setting, envy-freeness is one of the most widely adopted f...
Sijia Dai, Min-Ming Li, Xiao-Wei Wu et al.· 0 citations
Although deciding whether a TEF1 allocation exists is NP-hard even for goods, this work identifies several tractable settings and gives an exact pseudo-polynomial algorithm for deciding TEF1 existence.
Kui-Wang Choi, Min-Ming Li, Nicholas J. Teh· 10 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.