Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning
DOI10.1287/opre.2018.1808zbMath1444.90008OpenAlexW3123591491WikidataQ127735882 ScholiaQ127735882MaRDI QIDQ5129177
Hyun-Soo Ahn, Xiuli Chao, Boxiao Chen
Publication date: 26 October 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/116388
inventory controlasymptotic optimalitydynamic pricingnonparametric estimationdemand learningnonperishable products
Management decision making, including multiple objectives (90B50) Microeconomic theory (price theory and economic markets) (91B24) Inventory, storage, reservoirs (90B05)
Related Items (12)
Cites Work
- Unnamed Item
- Unnamed Item
- The multi-armed bandit, with constraints
- Jackknife, bootstrap and other resampling methods in regression analysis
- Combined Pricing and Inventory Control Under Uncertainty
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- The Data-Driven Newsvendor Problem: New Bounds and Insights
- Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems
- Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator
- Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies
- Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms
- Dynamic Pricing in the Presence of Inventory Considerations: Research Overview, Current Practices, and Future Directions
- A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand
- Consistency and asymptotic efficiency of slope estimates in stochastic approximation schemes
- Rate of Convergence for Constrained Stochastic Approximation Algorithms
- Pricing and the Newsvendor Problem: A Review with Extensions
- High-Dimensional Probability
- Blind Network Revenue Management
- Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems
- Online Network Revenue Management Using Thompson Sampling
- Logarithmic Regret Algorithms for Online Convex Optimization
- Multi-armed Bandits with Metric Switching Costs
- Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Finite Horizon Case
- Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models
- Improved Rates for the Stochastic Continuum-Armed Bandit Problem
- Stochastic Estimation of the Maximum of a Regression Function
- A Stochastic Approximation Method
This page was built for publication: Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning