DeepAI AI Chat
Log In Sign Up

Learning to Price Against a Moving Target

by   Renato Paes Leme, et al.

In the Learning to Price setting, a seller posts prices over time with the goal of maximizing revenue while learning the buyer's valuation. This problem is very well understood when values are stationary (fixed or iid). Here we study the problem where the buyer's value is a moving target, i.e., they change over time either by a stochastic process or adversarially with bounded variation. In either case, we provide matching upper and lower bounds on the optimal revenue loss. Since the target is moving, any information learned soon becomes out-dated, which forces the algorithms to keep switching between exploring and exploiting phases.


page 1

page 2

page 3

page 4


Online Second Price Auction with Semi-bandit Feedback Under the Non-Stationary Setting

In this paper, we study the non-stationary online second price auction p...

A Game-Theoretic Analysis of the Empirical Revenue Maximization Algorithm with Endogenous Sampling

The Empirical Revenue Maximization (ERM) is one of the most important pr...

Robust Learning of Optimal Auctions

We study the problem of learning revenue-optimal multi-bidder auctions f...

Learning to bid in revenue-maximizing auctions

We consider the problem of the optimization of bidding strategies in pri...

LP-based Approximation for Personalized Reserve Prices

We study the problem of computing revenue-optimal personalize (non-anony...

On Approximate Welfare- and Revenue-Maximizing Equilibria for Size-Interchangeable Bidders

In a Walrasian equilibrium (WE), all bidders are envy-free (EF), meaning...

Prior-Free Clock Auctions for Bidders with Interdependent Values

We study the problem of selling a good to a group of bidders with interd...