Access the full text.
Sign up today, get DeepDyve free for 14 days.
Cohen, M., Lobel, I., Leme, R. P. (2016)
Feature-based dynamic pricingWorking paper
Kareem Amin, Afshin Rostamizadeh, Umar Syed (2014)
Repeated Contextual Auctions with Strategic Buyers
L. Cijan (1979)
A polynomial algorithm in linear programming
(2017)
Pages 40–44 Ellipsoids for Contextual Dynamic Pricing · 44
Kleinberg, R., Leighton, T. (2003)
The value of knowing a demand curve: Bounds on regret for online posted-price auctionsProceedings of FOCS
L. Khachiyan (1980)
Polynomial algorithms in linear programmingUssr Computational Mathematics and Mathematical Physics, 20
I. Lobel, R. Leme, Adrian Vladu (2016)
Multidimensional Binary Search for Contextual Decision-MakingProceedings of the 2017 ACM Conference on Economics and Computation
Alekh Agarwal, Daniel Hsu, Satyen Kale, J. Langford, Lihong Li, R. Schapire (2014)
Taming the Monster: A Fast and Simple Algorithm for Contextual BanditsArXiv, abs/1402.0555
Robert Kleinberg, F. Leighton (2003)
The value of knowing a demand curve: bounds on regret for online posted-price auctions44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
P. Auer (2003)
Using Confidence Bounds for Exploitation-Exploration Trade-offsJ. Mach. Learn. Res., 3
Adel Javanmard, Hamid Nazerzadeh (2016)
Dynamic Pricing in High-DimensionsUSC Marshall: Other (Topic)
Maxime Cohen, I. Lobel, R. Leme (2016)
Feature-based Dynamic PricingProceedings of the 2016 ACM Conference on Economics and Computation
Lobel, I., Leme, R. P., Vladu, A. (2016)
Multidimensional binary search for contextual decision-makingWorking paper
Sheng Qiang, M. Bayati (2016)
Dynamic Pricing with Demand CovariatesERN: Pricing (Topic)
J. Wilkinson (1966)
The algebraic eigenvalue problem
We study the dynamic pricing problem faced by a firm selling differentiated products. At each period, the firm receives a new product, which is described by a vector of features. The firm needs to choose prices, but it does not know a priori the market value of the different features. We first consider an algorithm that we call PolytopePricing, but prove that it incurs worst-case regret that scales exponentially in the dimensionality of the feature space. We then consider a closely related algorithm, EllipsoidPricing, and show it incurs low regret with regards to both the time horizon and the dimensionality of the feature space. For more details, we refer the reader to our full paper.
ACM SIGecom Exchanges – Association for Computing Machinery
Published: Feb 24, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.