On consistency of optimal pricing algorithms in repeated posted-price auctions with strategic buyer

07/17/2017
by   Alexey Drutsa, et al.
0

We study revenue optimization learning algorithms for repeated posted-price auctions where a seller interacts with a single strategic buyer that holds a fixed private valuation for a good and seeks to maximize his cumulative discounted surplus. For this setting, first, we propose a novel algorithm that never decreases offered prices and has a tight strategic regret bound in Θ( T) under some mild assumptions on the buyer surplus discounting. This result closes the open research question on the existence of a no-regret horizon-independent weakly consistent pricing. The proposed algorithm is inspired by our observation that a double decrease of offered prices in a weakly consistent algorithm is enough to cause a linear regret. This motivates us to construct a novel transformation that maps a right-consistent algorithm to a weakly consistent one that never decreases offered prices. Second, we outperform the previously known strategic regret upper bound of the algorithm PRRFES, where the improvement is achieved by means of a finer constant factor C of the principal term C T in this upper bound. Finally, we generalize results on strategic regret previously known for geometric discounting of the buyer's surplus to discounting of other types, namely: the optimality of the pricing PRRFES to the case of geometrically concave decreasing discounting; and linear lower bound on the strategic regret of a wide range of horizon-independent weakly consistent algorithms to the case of arbitrary discounts.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/21/2019

Reserve Pricing in Repeated Second-Price Auctions with Strategic Bidders

We study revenue optimization learning algorithms for repeated second-pr...
research
07/08/2023

Contextual Dynamic Pricing with Strategic Buyers

Personalized pricing, which involves tailoring prices based on individua...
research
05/07/2018

Optimal Pricing in Repeated Posted-Price Auctions

We study revenue optimization pricing algorithms for repeated posted-pri...
research
12/25/2021

On Dynamic Pricing with Covariates

We consider the dynamic pricing problem with covariates under a generali...
research
02/25/2020

Dynamic Incentive-aware Learning: Robust Pricing in Contextual Auctions

Motivated by pricing in ad exchange markets, we consider the problem of ...
research
11/08/2019

Incentive-aware Contextual Pricing with Non-parametric Market Noise

We consider a dynamic pricing problem for repeated contextual second-pri...
research
03/06/2018

An Online Algorithm for Learning Buyer Behavior under Realistic Pricing Restrictions

We propose a new efficient online algorithm to learn the parameters gove...

Please sign up or login with your details

Forgot password? Click here to reset