Fetching the paper…
Reading the bibliography…
We consider dynamic pricing with many products under an evolving but low-dimensional demand model.
Consumer demand in the United States
H. S. Houthakker and L. D. Taylor · 1970
Earlier work this paper cites.
How can complex economical behavior be investigated? The example of the ignorant monopolist revisited
U. Witt · 1986
Earlier work this paper cites.
A software package for sequential quadratic programming
D. Kraft · 1988
Earlier work this paper cites.
Topics in Matrix Analysis
R. Horn and C. R. Johnson · 1991
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 convex optimization in the bandit setting: Gradient descent without a gradient
A. D. Flaxman, A. T. Kalai, and H. B. McMahan · 2005
Earlier work this paper cites.
Online convex optimization in the bandit setting: Gradient descent without a gradient
A. D. Flaxman, A. T. Kalai, and H. B. McMahan · 2005
Earlier work this paper cites.
Fast low-rank modifications of the thin singular value decomposition
M. Brand · 2006
Earlier work this paper cites.
The price of bandit information for online optimization
V Dani, T. P. Hayes, and S. M. Kakade · 2007
Earlier work this paper cites.
The Littlewood-Offord problem and invertibility of random matrices
M. Rudelson and R. Vershynin · 2008
Earlier work this paper cites.
On the efficient update of the singular value decomposition
P. Stange · 2008
Earlier work this paper cites.
The Littlewood-Offord problem and invertibility of random matrices
M. Rudelson and R. Vershynin · 2008
Earlier work this paper cites.
Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms
O. Besbes and A. Zeevi · 2009
Earlier work this paper cites.
Managerial Economics
T. Maurice · 2010
Earlier work this paper cites.
Online learning and online convex optimization
Shai Shalev-Shwartz · 2011
Cited alongside, same era.
The best of both worlds: Stochastic and adversarial bandits
S. Bubeck and A. Slivkins · 2012
Cited alongside, same era.
Introduction to the non-asymptotic analysis of random matrices
R. Vershynin · 2012
Cited alongside, same era.
Simultaneously learning and optimizing using controlled variance pricing
A. V. den Boer and Z. Bert · 2013
Cited alongside, same era.
High-dimensional gaussian process bandits
J. Djolonga, A. Krause, and V. Cevher · 2013
Cited alongside, same era.
Online learning with predictable sequences
A. Rakhlin and K. Sridharan · 2013
Cited alongside, same era.
A useful variant of the Davis-Kahan theorem for statisticians
Y. Yu, T. Wang, and R. Samworth · 2015
Later among the works it cites.
Feature-based dynamic pricing
M. Cohen, I Lobel, and R. P. Leme · 2016
Later among the works it cites.
Low-rank bandits with latent mixtures
A. Gopalan, O. Maillard, and M. Zaki · 2016
Later among the works it cites.
Dynamic pricing in high-dimensions
A. Javanmard and H. Nazerzadeh · 2016
Later among the works it cites.
Predictive collaborative filtering with side information
F. Zhao, M. Xiao, and Y. Guo · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Z. Wang, M. Zoghi, F. Hutter, D. Matheson, and N. de Freitas · 2013
Cited alongside, same era.
Bandit convex optimization: Towards tight bounds
E. Hazan and K. Y. Levy · 2014
Cited alongside, same era.
Dynamic pricing with an unknown demand model: asymptotically optimal semi-myopic policies
N. B. Keskin and A. Zeevi · 2014
Cited alongside, same era.
On the surprising sufficiency of linear models for dynamic pricing with demand learning
O. Besbes and A. Zeevi · 2015
Cited alongside, same era.
High dimensional statistics, 2015
P. Rigollet · 2015
Cited alongside, same era.
A useful variant of the Davis-Kahan theorem for statisticians
Y. Yu, T. Wang, and R. Samworth · 2015
Cited alongside, same era.
C. Li, K. Kandasamy, B. Poczos, and J. Schneider · 2016
Later among the works it cites.
Kernel-based methods for bandit convex optimization
S. Bubeck, Y. T. Lee, and R. Eldan · 2017
Later among the works it cites.
On the sample complexity of the linear quadratic regulator
S. Dean, H. Mania, N. Matni, B. Recht, and S. Tu · 2017
Later among the works it cites.
Perishability of data: Dynamic pricing under varying-coefficient models
A. Javanmard · 2017
Later among the works it cites.
Dynamic online pricing with incomplete information using multi-armed bandit experiments
K. Misra, E. M. Schwartz, and J. Abernethy · 2017
Later among the works it cites.
Contextual bandits with latent confounders: An NMF approach
R. Sen, K. Shanmugam, M. Kocaoglu, A. Dimakis, and S. Shakkottai · 2017
Later among the works it cites.
CBRAP: Contextual bandits with random projection
X. Yu, M. R. Lyu, and I. King · 2017
Later among the works it cites.
Modeling persistent trends in distributions
J. Mueller, T. Jaakkola, and D. Gifford · 2018
Closest in time.