Dynamic pricing in high-dimensions
From MaRDI portal
Publication:4633016
zbMATH Open1484.91202arXiv1609.07574MaRDI QIDQ4633016FDOQ4633016
Authors: A. Javanmard, Hamid Nazerzadeh 
Publication date: 2 May 2019
Full work available at URL: https://arxiv.org/abs/1609.07574
Recommendations
- Dynamic pricing under a general parametric choice model
- Perishability of data: dynamic pricing under varying-coefficient models
- Dynamic pricing without knowing the demand function: risk bounds and near-optimal algorithms
- Dynamic Pricing and Learning with Finite Inventories
- Dynamic pricing with finite price sets: a non-parametric approach
Estimation in multivariate analysis (62H12) Applications of statistics to actuarial sciences and financial mathematics (62P05) Microeconomic theory (price theory and economic markets) (91B24)
Cites Work
- Title not available (Why is that?)
- Statistics for high-dimensional data. Methods, theory and applications.
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- High-dimensional generalized linear models and the lasso
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Introduction to nonparametric estimation
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls
- Reconstruction From Anisotropic Random Measurements
- Log-concave probability and its applications
- Optimal Experimentation in a Changing Environment
- One-bit compressed sensing by linear programming
- Optimal Auction Design
- The theory and practice of revenue management
- Information-theoretic determination of minimax rates of convergence
- Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies
- Dynamic pricing for nonperishable products with demand learning
- Dynamic pricing without knowing the demand function: risk bounds and near-optimal algorithms
- Dynamic Pricing Under a General Parametric Choice Model
- Chasing Demand: Learning and Earning in a Changing Environment
- Submersions and preimages of sets of measure zero
- Close the gaps: a learning-while-doing algorithm for single-product revenue management problems
- Online Decision Making with High-Dimensional Covariates
- A linear response bandit problem
- Dynamic Assortment Personalization in High Dimensions
- Bandits with Knapsacks
- Online Network Revenue Management Using Thompson Sampling
- Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions
- Title not available (Why is that?)
Cited In (11)
- Contextual Search via Intrinsic Volumes
- Policy Optimization Using Semiparametric Models for Dynamic Pricing
- Dynamic pricing for impatient bidders
- A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint
- Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions
- Dynamic pricing with real-time demand learning
- Algorithms and Computation
- Dynamic price discrimination with customer recognition
- Online Regularization toward Always-Valid High-Dimensional Dynamic Pricing
- On the minimax complexity of pricing in a changing environment
- Smoothness-Adaptive Contextual Bandits
This page was built for publication: Dynamic pricing in high-dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633016)
