2025
Online Resource Sharing: Better Robust Guarantees via Randomized Strategies
IJCAI 2025
We study the problem of fair online resource allocation via non-monetary mechanisms, where multiple agents repeatedly share a resource without monetary transfers. Previous work has shown that every agent can guarantee 1/2 of their ideal utility (the highest achievable utility given their fair share