Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms
From MaRDI portal
Publication:3100437
DOI10.1287/opre.1080.0640zbMath1233.90011OpenAlexW3122984617WikidataQ110700659 ScholiaQ110700659MaRDI QIDQ3100437
Publication date: 24 November 2011
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1190&context=oid_papers
learningasymptotic analysisvalue of informationrevenue managementexploration-exploitationpricing estimation
Management decision making, including multiple objectives (90B50) Microeconomic theory (price theory and economic markets) (91B24) Inventory, storage, reservoirs (90B05)
Related Items (68)
On the Futility of Dynamics in Robust Mechanism Design ⋮ Competitive analysis of online revenue management with hierarchical resources ⋮ General dynamic pricing algorithms based on universal exponential booking curves ⋮ Investment Timing with Incomplete Information and Multiple Means of Learning ⋮ Asymptotically optimal dynamic pricing for network revenue management ⋮ Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds ⋮ Constant Regret Resolving Heuristics for Price-Based Revenue Management ⋮ Tracking the market: dynamic pricing and learning in a changing environment ⋮ Response-adaptive designs for clinical trials: simultaneous learning from multiple patients ⋮ Improving multi-armed bandit algorithms in online pricing settings ⋮ Dynamic Pricing and Learning with Finite Inventories ⋮ Simple pricing schemes for consumers with evolving values ⋮ Learning and Pricing with Models That Do Not Explicitly Incorporate Competition ⋮ Data-Driven Pricing for a New Product ⋮ Pricing with Samples ⋮ Bayesian Exploration: Incentivizing Exploration in Bayesian Games ⋮ Quantity Premiums and Discounts in Dynamic Pricing ⋮ Coupled Learning Enabled Stochastic Programming with Endogenous Uncertainty ⋮ Optimal pricing to minimize maximum regret with limited demand information ⋮ Contextual Search via Intrinsic Volumes ⋮ Dynamic Inventory Control with Fixed Setup Costs and Unknown Discrete Demand Distribution ⋮ Dynamic Learning and Decision Making via Basis Weight Vectors ⋮ Nonparametric advertising budget allocation with inventory constraint ⋮ On dynamic pricing under model uncertainty ⋮ Unnamed Item ⋮ Data‐driven research in retail operations—A review ⋮ Newsvendor-type models with decision-dependent uncertainty ⋮ Social welfare and profit maximization from revealed preferences ⋮ Mechanisms of cooperation between airlines and online travel agencies for flight crowdfunding ⋮ Price discrimination with robust beliefs ⋮ Dynamic Bertrand oligopoly ⋮ Policy Optimization Using Semiparametric Models for Dynamic Pricing ⋮ Dynamic scheduling with uncertain job types ⋮ Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning ⋮ Bandits with Global Convex Constraints and Objective ⋮ A Data-Driven Functionally Robust Approach for Simultaneous Pricing and Order Quantity Decisions with Unknown Demand Function ⋮ A pricing problem with unknown arrival rate and price sensitivity ⋮ Online Network Revenue Management Using Thompson Sampling ⋮ 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 ⋮ Dynamic pricing with finite price sets: a non-parametric approach ⋮ A minmax regret price control model for managing perishable products with uncertain parameters ⋮ A Bayesian learning model for estimating unknown demand parameter in revenue management ⋮ Pricing of reusable resources under ambiguous distributions of demand and service time with emerging applications ⋮ Learning and pricing models for repeated generalized second-price auction in search advertising ⋮ Stochastic revision opportunities in Markov decision problems ⋮ Pricing to accelerate demand learning in dynamic assortment planning for perishable products ⋮ Nonparametric Self-Adjusting Control for Joint Learning and Optimization of Multiproduct Pricing with Finite Resource Capacity ⋮ Bayesian Incentive-Compatible Bandit Exploration ⋮ Unnamed Item ⋮ Testing the robustness of deterministic models of optimal dynamic pricing and lot-sizing for deteriorating items under stochastic conditions ⋮ On Policies for Single-Leg Revenue Management with Limited Demand Information ⋮ Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions ⋮ Incentive-Compatible Learning of Reserve Prices for Repeated Auctions ⋮ Technical Note—Joint Learning and Optimization of Multi-Product Pricing with Finite Resource Capacity and Unknown Demand Parameters ⋮ Matching While Learning ⋮ Dynamic Pricing with Multiple Products and Partially Specified Demand Distribution ⋮ Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand ⋮ Revenue management under randomly evolving economic conditions ⋮ Online Resource Allocation Under Partially Predictable Demand ⋮ Nonparametric Pricing Analytics with Customer Covariates ⋮ A revisit to the markup practice of irreversible dynamic pricing ⋮ Unnamed Item ⋮ A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint ⋮ Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems ⋮ Optimal online markdown and markup pricing policies with demand uncertainty ⋮ Robust pricing for airlines with partial information
This page was built for publication: Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms
