4 papers
Robust Resource Allocation via Competitive Subsidies
David X. Lin, Giannis Fikioris, Siddhartha Banerjee +1
A canonical setting for non-monetary online resource allocation is one where agents compete over multiple rounds for a single item per round, with i.i.d. valuations and additive ut…
Dynamic Allocation of Public Goods with Approximate Core Equilibria
Chido Onyeze, David X. Lin, Siddhartha Banerjee +1
We consider the problem of repeatedly allocating multiple shareable public goods that have limited availability in an online setting without the use of money. In our setting, agent…
Robust Equilibria in Shared Resource Allocation via Strengthening Border's Theorem
David X. Lin, Siddhartha Banerjee, Giannis Fikioris +1
We consider repeated allocation of a shared resource via a non-monetary mechanism, wherein a single item must be allocated to one of multiple agents in each round. We assume that e…
Online Resource Sharing: Better Robust Guarantees via Randomized Strategies
David X. Lin, Daniel Hall, Giannis Fikioris +2
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…