2 citations · 5 across the 7 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
Envy-Free Allocation of Indivisible Goods via Noisy Queries
Zihan Li, Yan Hao Ling, Jonathan Scarlett +1
We introduce a problem of fairly allocating indivisible goods (items) in which the agents' valuations cannot be observed directly, but instead can only be accessed via noisy querie…
cs.GT2024
Complexity of Round-Robin Allocation with Potentially Noisy Queries
Zihan Li, Pasin Manurangsi, Jonathan Scarlett +1
We study the complexity of a fundamental algorithm for fairly allocating indivisible items, the round-robin algorithm. For agents and items, we show that the algorithm can…