Prior-Free Dynamic Auctions with Low Regret Buyers

We study the problem of how to repeatedly sell to a buyer running a no-regret,mean-based algorithm. Previous work [Braverman et al., 2018] shows that it ispossible to design effective mechanisms in such a setting that extract almost allof the economic surplus, but these mechanisms require the buyer's values each