Fetching the paper…
Reading the bibliography…
Motivated by posted price auctions where buyers are grouped in an unknown number of latent types characterized by their private values for the good on sale, we investigate revenue maximization in stochastic dynamic pricing when the distribution of buyers' private values is supported on an unknown set of points in [0,1] of unknown cardinality $K$.
A two-armed bandit theory of market pricing
M. Rothschild · 1974
Earlier work this paper cites.
The value of knowing a demand curve: Bounds on regret for online posted-price auctions
R. Kleinberg and T. Leighton · 2003
Earlier work this paper cites.
Online learning in online auctions
A. Blum, V. Kumar, A. Rudra, and F. Wu · 2004
Earlier work this paper cites.
Near-optimal online auctions
A. Blum and J. D. Hartline · 2005
Earlier work this paper cites.
Prediction, learning, and games
N. Cesa-Bianchi and G. Lugosi · 2006
Earlier work this paper cites.
Noisy binary search and its applications
R. M. Karp and R. Kleinberg · 2007
Earlier work this paper cites.
Empirical bernstein bounds and sample-variance penalization
A. Maurer and M. Pontil · 2009
Earlier work this paper cites.
The design of advertising exchanges
R. P. McAfee · 2011
Earlier work this paper cites.
Dynamic pricing under a general parametric choice model
J. Broder and P. Rusmevichientong · 2012
Cited alongside, same era.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
S. Bubeck and N. Cesa-Bianchi · 2012
Cited alongside, same era.
Market Segmentation: Conceptual and Methodological Foundations
M. Wedel and W. Kamakura · 2012
Cited alongside, same era.
Learning prices for repeated auctions with strategic buyers
K. Amin, A. Rostamizadeh, and U. Syed · 2013
Cited alongside, same era.
Bandits with knapsacks
A. Badanidiyuru, R. Kleinberg, and A. Slivkins · 2013
Cited alongside, same era.
Bounded regret in stochastic multi-armed bandits
S. Bubeck, V. Perchet, and P. Rigollet · 2013
Cited alongside, same era.
Dynamic pricing with limited supply
M. Babaioff, S. Dughmi, R. Kleinberg, and A. Slivkins · 2015
Later among the works it cites.
Dynamic pricing and learning: historical origins, current research, and new directions
A. V. den Boer · 2015
Later among the works it cites.
Dynamic Pricing Under Model Uncertainty
A. Slivkins and A. Zeevi · 2015
Later among the works it cites.
Online learning in repeated auctions
J. Weed, V. Perchet, and P. Rigollet · 2016
Later among the works it cites.
Fast rates for bandit optimization with upper-confidence frank-wolfe
Q. Berthet and V. Perchet · 2017
Later among the works it cites.
Online auctions and multi-scale online learning
S. Bubeck, N. R. Devanur, Z. Huang, and R. Niazadeh · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Bandits with concave rewards and convex knapsacks
S. Agrawal and N. R. Devanur · 2014
Cited alongside, same era.
Perfect Bayesian equilibria in repeated sales
N. R. Devanur, Y. Peres, and B. Sivan · 2014
Cited alongside, same era.
Finite-time analysis of the multiarmed bandit problem
P. Auer, N. Cesa-Bianchi, and P. Fischer
Cited in the paper.
The nonstochastic multiarmed bandit problem
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. Schapire
Cited in the paper.
Auction mechanics: A buyer’s perspective
A. Cotarmanac’h · 2017
Later among the works it cites.
Discontinuous demand functions: Estimation and pricing
A. den Boer and N. B. Keskin · 2017
Later among the works it cites.