7 papers
Learning vs. Optimizing Bidders in Budgeted Auctions
Giannis Fikioris, Balasubramanian Sivan, Ãva Tardos
The study of repeated interactions between a learner and a utility-maximizing optimizer has yielded deep insights into the manipulability of learning algorithms. However, existing…
Games with Payments between Learning Agents
Yoav Kolumbus, Joe Halpern, Ãva Tardos
In repeated games, such as auctions, players rely on autonomous learning agents to choose their actions. We study settings in which players have their agents make monetary transfer…
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…
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…
Learning in Budgeted Auctions with Spacing Objectives
Giannis Fikioris, Robert Kleinberg, Yoav Kolumbus +3
In many repeated auction settings, participants care not only about how frequently they win but also how their winnings are distributed over time. This problem arises in various pr…
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…