We study the truthful and fair allocation of indivisible goods to $n$ strategic agents with additive valuations. Babaioff, Feige, and Manaker Morag [FOCS 2026] gave a randomized mechanism that uses only the agents'rankings of the goods, is truthful in expectation (TIE), and guarantees every agent $1/(H_{n-1}+2)=\Theta(...
We investigate the query complexity of fairly allocating $m$ indivisible chores among $n$ agents with additive cost functions. We depart from the standard cardinal model and assume only comparison access: an algorithm may ask an agent which of two bundles is less costly, but never observes numerical costs. Our first re...
Ze-Han Lin, Shengxin Liu, Biaoshuai Tao et al.· 0 citations
Sequential allocation mechanisms contain a class of widely studied mechanisms (e.g., round-robin) in the fair division of indivisible goods, where agents take turns picking items in a predefined picking order. It is known that the sequential allocation mechanisms are not truthful: when an agent's most preferred item is...
Xiao-Lin Bu, Biaoshuai Tao· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.