Dynamic Pricing Under a General Parametric Choice Model

DOI10.1287/opre.1120.1057zbMath1260.91094MaRDI QIDQ3144408

Paat Rusmevichientong, Josef Broder

Publication date: 7 December 2012

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b8e0b5ca4522e9654dfd5a263fe9c88f87c9cb82

zbMATH Keywords

dynamic pricing; customer choice model

Mathematics Subject Classification ID

91B70: Stochastic models in economics

91B24: Microeconomic theory (price theory and economic markets)

Related Items

Unnamed Item, Learning to Optimize via Information-Directed Sampling, On Incomplete Learning and Certainty-Equivalence Control, Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions, Technical Note—Joint Learning and Optimization of Multi-Product Pricing with Finite Resource Capacity and Unknown Demand Parameters, Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand, Nonparametric Pricing Analytics with Customer Covariates, Constant Regret Resolving Heuristics for Price-Based Revenue Management, Data-Driven Pricing for a New Product, Pricing with Samples, Dynamic Learning and Decision Making via Basis Weight Vectors, Unnamed Item, Dynamic Inventory and Price Controls Involving Unknown Demand on Discrete Nonperishable Items, Technical Note—Data-Based Dynamic Pricing and Inventory Control with Censored Demand and Limited Price Changes, Optimal Online Learning for Nonlinear Belief Models Using Discrete Priors, Nonparametric Self-Adjusting Control for Joint Learning and Optimization of Multiproduct Pricing with Finite Resource Capacity, Dynamic Pricing with Multiple Products and Partially Specified Demand Distribution, A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint, The Exploration-Exploitation Trade-off in the Newsvendor Problem, Technical note: <scp>Finite‐time</scp> regret analysis of <scp>Kiefer‐Wolfowitz</scp> stochastic approximation algorithm and nonparametric <scp>multi‐product</scp> dynamic pricing with unknown demand, Recurrence-based reconstruction of dynamic pricing attractors, Tracking the market: dynamic pricing and learning in a changing environment, Improving multi-armed bandit algorithms in online pricing settings, A Bayesian learning model for estimating unknown demand parameter in revenue management, A revisit to the markup practice of irreversible dynamic pricing, Nonparametric advertising budget allocation with inventory constraint, Social welfare and profit maximization from revealed preferences, A pricing problem with unknown arrival rate and price sensitivity, Dynamic pricing with finite price sets: a non-parametric approach, Dynamic pricing with Bayesian demand learning and reference price effect, Optimal pricing to minimize maximum regret with limited demand information, Non-Stationary Stochastic Optimization, Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems, Learning and Pricing with Models That Do Not Explicitly Incorporate Competition, Dynamic Pricing and Learning with Finite Inventories