Dynamic pricing under nested logit demand
From MaRDI portal
Publication:5024972
zbMATH Open1478.90090arXiv2101.04486MaRDI QIDQ5024972FDOQ5024972
Authors: David Müller, Vladimir Shikhman, Yuri Nesterov
Publication date: 1 February 2022
Abstract: Recently, there is growing interest and need for dynamic pricing algorithms, especially, in the field of online marketplaces by offering smart pricing options for big online stores. We present an approach to adjust prices based on the observed online market data. The key idea is to characterize optimal prices as minimizers of a total expected revenue function, which turns out to be convex. We assume that consumers face information processing costs, hence, follow a discrete choice demand model, and suppliers are equipped with quantity adjustment costs. We prove the strong smoothness of the total expected revenue function by deriving the strong convexity modulus of its dual. Our gradient-based pricing schemes outbalance supply and demand at the convergence rates of and , respectively. This suggests that the imperfect behavior of consumers and suppliers helps to stabilize the market.
Full work available at URL: https://arxiv.org/abs/2101.04486
Recommendations
Cited In (9)
- Network manipulation algorithm based on inexact alternating minimization
- Continuous-time dynamic pricing for stabilizing stochastic demand
- Towards transfer learning for revenue and pricing management
- A min-price matrix method to solve mixed product-set pricing problems
- Automated repricing and ordering strategies in competitive markets
- Price optimization under the extended nested logit model
- Technical note: Dynamic pricing and demand learning with limited price experimentation
- Stochastic optimization for dynamic pricing
- The effect of demand variability on the adoption and design of a third party's pricing algorithm
This page was built for publication: Dynamic pricing under nested logit demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5024972)