The following pages link to Blind Network Revenue Management (Q4909121):
Displaying 26 items.
- Optimal multi-unit mechanisms with private demands (Q2173417) (← links)
- A review of revenue management: recent generalizations and advances in industry applications (Q2178060) (← 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)
- Pricing of reusable resources under ambiguous distributions of demand and service time with emerging applications (Q2282508) (← links)
- Procedural rationality, asset heterogeneity and market selection (Q2425148) (← links)
- Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems (Q2875601) (← links)
- Dynamic Pricing and Learning with Finite Inventories (Q3465597) (← links)
- The Value of Dynamic Pricing in Large Queueing Systems (Q4969334) (← links)
- Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy (Q4994149) (← 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)
- Stochastic Optimization for Dynamic Pricing (Q5054161) (← links)
- Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management (Q5058047) (← links)
- Constant Regret Resolving Heuristics for Price-Based Revenue Management (Q5060522) (← links)
- Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning (Q5129177) (← links)
- Bandits with Global Convex Constraints and Objective (Q5129206) (← links)
- Online Network Revenue Management Using Thompson Sampling (Q5131540) (← links)
- Asymptotically optimal dynamic pricing for network revenue management (Q5168855) (← links)
- Nonparametric Self-Adjusting Control for Joint Learning and Optimization of Multiproduct Pricing with Finite Resource Capacity (Q5219731) (← links)
- A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint (Q5870348) (← links)
- Adversarial bandits with knapsacks (Q6551256) (← links)
