Pages that link to "Item:Q4974598"
From MaRDI portal
The following pages link to Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems (Q4974598):
Displayed 12 items.
- On two continuum armed bandit problems in high dimensions (Q260274) (← links)
- Adaptive-treed bandits (Q888482) (← links)
- Stochastic continuum-armed bandits with additive models: minimax regrets and adaptive algorithm (Q2091834) (← links)
- A pricing problem with unknown arrival rate and price sensitivity (Q2216175) (← links)
- A revision game of experimentation on a common threshold (Q2295833) (← links)
- Non-Stationary Stochastic Optimization (Q2795881) (← links)
- Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models (Q5026455) (← links)
- Infinite Arms Bandit: Optimality via Confidence Bounds (Q5089465) (← links)
- Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information (Q5095163) (← links)
- Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning (Q5129177) (← links)
- Dynamic Pricing with Multiple Products and Partially Specified Demand Distribution (Q5244873) (← links)
- Technical note: <scp>Finite‐time</scp> regret analysis of <scp>Kiefer‐Wolfowitz</scp> stochastic approximation algorithm and nonparametric <scp>multi‐product</scp> dynamic pricing with unknown demand (Q6072149) (← links)