3 papers
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…
stat.ML2024
Regret Bounds for Noise-Free Cascaded Kernelized Bandits
Zihan Li, Jonathan Scarlett
We consider optimizing a function network in the noise-free grey-box setting with RKHS function classes, where the exact intermediate results are observable. We assume that the str…
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…