Multi-armed Bandits with Metric Switching Costs
From MaRDI portal
Publication:5321680
DOI10.1007/978-3-642-02930-1_41zbMath1248.91027OpenAlexW2119840952MaRDI QIDQ5321680
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_41
Related Items (12)
Approximation algorithms for stochastic combinatorial optimization problems ⋮ Polymatroid Prophet Inequalities ⋮ Non-adaptive stochastic score classification and explainable halfspace evaluation ⋮ On the adaptivity gap of stochastic orienteering ⋮ Unnamed Item ⋮ Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning ⋮ Matroid prophet inequalities and applications to multi-dimensional mechanism design ⋮ When LP is the cure for your matching woes: improved bounds for stochastic matchings ⋮ Efficient crowdsourcing of unknown experts using bounded multi-armed bandits ⋮ Unnamed Item ⋮ Running Errands in Time: Approximation Algorithms for Stochastic Orienteering ⋮ Unnamed Item
This page was built for publication: Multi-armed Bandits with Metric Switching Costs