Pages that link to "Item:Q5321680"
From MaRDI portal
The following pages link to Multi-armed Bandits with Metric Switching Costs (Q5321680):
Displaying 12 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- On the adaptivity gap of stochastic orienteering (Q896283) (← links)
- Matroid prophet inequalities and applications to multi-dimensional mechanism design (Q1735736) (← links)
- Efficient crowdsourcing of unknown experts using bounded multi-armed bandits (Q2014933) (← links)
- Non-adaptive stochastic score classification and explainable halfspace evaluation (Q2164705) (← links)
- Polymatroid Prophet Inequalities (Q3452806) (← links)
- Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning (Q5129177) (← links)
- (Q5136319) (← links)
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
- (Q5743496) (← links)
- (Q5875506) (← links)
