Least squares approximate policy iteration for learning bid prices in choice-based revenue management
From MaRDI portal
Publication:1652041
DOI10.1016/j.cor.2016.07.015zbMath1391.90629OpenAlexW2488456443MaRDI QIDQ1652041
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.015
Management decision making, including multiple objectives (90B50) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)
Related Items (5)
Optimization and approximation methods for dynamic appointment scheduling with patient choices ⋮ A review of revenue management: recent generalizations and advances in industry applications ⋮ Hybrid nesting control strategy for passenger railway with one‐seat‐one‐ticket restriction ⋮ Route-based approximate dynamic programming for dynamic pricing in attended home delivery ⋮ A review of choice-based revenue management: theory and methods
Cites Work
- Unnamed Item
- An option-based revenue management procedure for strategic airline alliances
- Network revenue management with inventory-sensitive bid prices and customer choice
- Approximate dynamic programming for capacity allocation in the service industry
- Network capacity control using self-adjusting bid-prices
- Dynamic pricing and automated resource allocation for complex information services. Reinforcement learning and combinatorial auctions. With forewords by Wolfgang Köning and Oliver Wendt
- A two-stage bid-price control for make-to-order revenue management
- A reinforcement learning algorithm based on policy iteration for average reward: Empirical results with yield management and convergence analysis
- On complexity of unconstrained hyperbolic 0--1 programming problems
- The theory and practice of revenue management
- Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
- Sell or store? An ADP approach to marketing renewable energy
- Integrated revenue management approaches for capacity control with planned upgrades
- Retail supply chain management. Quantitative models and empirical studies. With a foreword by Hau L. Lee
- Reductions of Approximate Linear Programs for Network Revenue Management
- Approximate Dynamic Programming for Ambulance Redeployment
- On the Approximate Linear Programming Approach for Network Revenue Management Problems
- Decomposing inventory routing problems with approximate value functions
- Approximate Dynamic Programming
- A Column Generation Algorithm for Choice-Based Network Revenue Management
- An Optimal Approximate Dynamic Programming Algorithm for the Lagged Asset Acquisition Problem
- Bid-Price Controls for Network Revenue Management: Martingale Characterization of Optimal Bid Prices
- Discrete Choice Methods with Simulation
- Dynamic Bid Prices in Revenue Management
- Simulation-Based Optimization of Virtual Nesting Controls for Network Revenue Management
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- 10.1162/1532443041827907
- Optimizing Trading Decisions for Hydro Storage Systems Using Approximate Dual Dynamic Programming
- An Optimal Approximate Dynamic Programming Algorithm for Concave, Scalar Storage Problems With Vector-Valued Controls
This page was built for publication: Least squares approximate policy iteration for learning bid prices in choice-based revenue management
