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
No-Regret Algorithms for Safe Bayesian Optimization with Monotonicity Constraints
Arpan Losalka, Jonathan Scarlett
We consider the problem of sequentially maximizing an unknown function over a set of actions of the form , where the selected actions must satisfy a safety cons…
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…