Pages that link to "Item:Q2875601"
From MaRDI portal
The following pages link to Close the gaps: a learning-while-doing algorithm for single-product revenue management problems (Q2875601):
Displaying 35 items.
- On the resolution of misspecified convex optimization and monotone variational inequality problems (Q782913) (← links)
- A Bayesian learning model for estimating unknown demand parameter in revenue management (Q2030522) (← links)
- A revisit to the markup practice of irreversible dynamic pricing (Q2095191) (← links)
- Robust pricing for airlines with partial information (Q2115756) (← links)
- Nonparametric advertising budget allocation with inventory constraint (Q2183869) (← links)
- Social welfare and profit maximization from revealed preferences (Q2190403) (← links)
- A pricing problem with unknown arrival rate and price sensitivity (Q2216175) (← links)
- Dynamic pricing with finite price sets: a non-parametric approach (Q2238754) (← links)
- Learning and pricing models for repeated generalized second-price auction in search advertising (Q2282562) (← links)
- Dynamic pricing with Bayesian demand learning and reference price effect (Q2312346) (← links)
- Optimal pricing to minimize maximum regret with limited demand information (Q2664419) (← links)
- Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms (Q3100437) (← links)
- Dynamic Pricing and Learning with Finite Inventories (Q3465597) (← links)
- (Q4633016) (← links)
- Incentive-Compatible Learning of Reserve Prices for Repeated Auctions (Q4994171) (← links)
- Technical Note—Joint Learning and Optimization of Multi-Product Pricing with Finite Resource Capacity and Unknown Demand Parameters (Q4994175) (← links)
- Matching While Learning (Q4994180) (← links)
- Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand (Q5000652) (← links)
- Nonparametric Pricing Analytics with Customer Covariates (Q5003728) (← links)
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (Q5058054) (← links)
- Constant Regret Resolving Heuristics for Price-Based Revenue Management (Q5060522) (← links)
- Data-Driven Pricing for a New Product (Q5080649) (← links)
- Bayesian Exploration: Incentivizing Exploration in Bayesian Games (Q5080666) (← links)
- Contextual Search via Intrinsic Volumes (Q5092512) (← links)
- Dynamic Inventory Control with Fixed Setup Costs and Unknown Discrete Demand Distribution (Q5095159) (← links)
- Multiproduct Pricing with Discrete Price Sets (Q5106362) (← links)
- Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning (Q5129177) (← links)
- A Data-Driven Functionally Robust Approach for Simultaneous Pricing and Order Quantity Decisions with Unknown Demand Function (Q5129212) (← links)
- Online Network Revenue Management Using Thompson Sampling (Q5131540) (← links)
- Dynamic Inventory and Price Controls Involving Unknown Demand on Discrete Nonperishable Items (Q5144768) (← links)
- Nonparametric Self-Adjusting Control for Joint Learning and Optimization of Multiproduct Pricing with Finite Resource Capacity (Q5219731) (← links)
- ASYMPTOTICALLY OPTIMAL MULTI-ARMED BANDIT POLICIES UNDER A COST CONSTRAINT (Q5358116) (← links)
- COMPETITIVE ANALYSIS OF INTERRELATED PRICE ONLINE INVENTORY PROBLEMS WITH DEMANDS (Q5370792) (← links)
- A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint (Q5870348) (← links)
- Adversarial bandits with knapsacks (Q6551256) (← links)
