Pages that link to "Item:Q3100437"
From MaRDI portal
The following pages link to Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms (Q3100437):
Displayed 50 items.
- Tracking the market: dynamic pricing and learning in a changing environment (Q320123) (← links)
- Response-adaptive designs for clinical trials: simultaneous learning from multiple patients (Q320737) (← links)
- Dynamic Bertrand oligopoly (Q626425) (← links)
- Competitive analysis of online revenue management with hierarchical resources (Q1628685) (← links)
- Improving multi-armed bandit algorithms in online pricing settings (Q1644914) (← links)
- A minmax regret price control model for managing perishable products with uncertain parameters (Q1751687) (← links)
- Newsvendor-type models with decision-dependent uncertainty (Q1935947) (← 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)
- Simple pricing schemes for consumers with evolving values (Q2155905) (← 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)
- Learning and pricing models for repeated generalized second-price auction in search advertising (Q2282562) (← links)
- Stochastic revision opportunities in Markov decision problems (Q2288856) (← links)
- Testing the robustness of deterministic models of optimal dynamic pricing and lot-sizing for deteriorating items under stochastic conditions (Q2323437) (← links)
- Optimal online markdown and markup pricing policies with demand uncertainty (Q2353645) (← links)
- Pricing to accelerate demand learning in dynamic assortment planning for perishable products (Q2514887) (← links)
- Optimal pricing to minimize maximum regret with limited demand information (Q2664419) (← links)
- Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems (Q2875601) (← links)
- Quantity Premiums and Discounts in Dynamic Pricing (Q2931704) (← links)
- Revenue management under randomly evolving economic conditions (Q3120608) (← links)
- Learning and Pricing with Models That Do Not Explicitly Incorporate Competition (Q3195232) (← links)
- Bayesian Incentive-Compatible Bandit Exploration (Q3387959) (← links)
- Investment Timing with Incomplete Information and Multiple Means of Learning (Q3453345) (← links)
- Dynamic Pricing and Learning with Finite Inventories (Q3465597) (← links)
- (Q4633016) (← links)
- On Policies for Single-Leg Revenue Management with Limited Demand Information (Q4994151) (← links)
- Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions (Q4994157) (← 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)
- Online Resource Allocation Under Partially Predictable Demand (Q5003724) (← links)
- Nonparametric Pricing Analytics with Customer Covariates (Q5003728) (← links)
- On the Futility of Dynamics in Robust Mechanism Design (Q5031660) (← links)
- General dynamic pricing algorithms based on universal exponential booking curves (Q5047128) (← 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)
- Pricing with Samples (Q5080664) (← links)
- Bayesian Exploration: Incentivizing Exploration in Bayesian Games (Q5080666) (← links)
- Coupled Learning Enabled Stochastic Programming with Endogenous Uncertainty (Q5085157) (← links)
- Contextual Search via Intrinsic Volumes (Q5092512) (← links)
- Dynamic Inventory Control with Fixed Setup Costs and Unknown Discrete Demand Distribution (Q5095159) (← links)
- Dynamic Learning and Decision Making via Basis Weight Vectors (Q5095179) (← links)
- Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning (Q5129177) (← links)