Thompson Sampling for Bayesian Bandits with Resets

DOI10.1007/978-3-642-41575-3_31zbMATH Open1406.91073OpenAlexW2284023708MaRDI QIDQ2868572

Paolo Viappiani

Publication date: 17 December 2013

Published in: Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-41575-3_31

zbMATH Keywords

exploitationexplorationmulti-armed bandit problemThompson samplingBayesian bandits

Mathematics Subject Classification ID

Sequential statistical analysis (62L10) Probabilistic games; gambling (91A60) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (4)

Linear Thompson sampling revisited ⋮ Sliding-Window Thompson Sampling for Non-Stationary Settings ⋮ An information-theoretic analysis of Thompson sampling ⋮ On the Prior Sensitivity of Thompson Sampling

Recommendations

• Title not available (Why is that?) 👍 👎
• Linear Thompson sampling revisited 👍 👎
• On the Prior Sensitivity of Thompson Sampling 👍 👎
• Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis 👍 👎
• A Tutorial on Thompson Sampling 👍 👎
• Thompson Sampling for Stochastic Control: The Finite Parameter Case 👍 👎
• Near-Optimal Regret Bounds for Thompson Sampling 👍 👎
• Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning 👍 👎
• Sliding-Window Thompson Sampling for Non-Stationary Settings 👍 👎
• Thompson Sampling for Stochastic Control: The Continuous Parameter Case 👍 👎

This page was built for publication: Thompson Sampling for Bayesian Bandits with Resets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868572)