Thompson sampling-based recursive block elimination for dynamic assignment under limited budget in pure-exploration

DOI10.1007/S10618-024-01083-2MaRDI QIDQ6663814zbMATH OpenFDO

Authors Shameem Puthiya Parambath, Christos Anagnostopoulos, Saleh Abdullah M. Alfahad

Publication date 15 January 2025

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10618-024-01083-2

zbMATH Keywords

dynamic assignmentdynamic pricinglearning with feedbackmulti-armed banditspure-explorationsequential learningThompson sampling

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05)

Recommendations

• Asymptotically optimal algorithms for budgeted multiple play bandits
• A Tutorial on Thompson Sampling
• Approximation algorithms for budgeted learning problems

Cites work

• X-armed bandits
• Bandit algorithms
• Bandits and Experts in Metric Spaces
• Finite-time analysis of the multiarmed bandit problem
• scientific article; zbMATH DE number 5485582 (Why is no real title available?)
• On Sequential Elimination Algorithms for Best-Arm Identification in Multi-Armed Bandits
• Prediction, Learning, and Games
• Pure exploration in finitely-armed and continuous-armed bandits
• Reinforcement learning. An introduction
• The Nonstochastic Multiarmed Bandit Problem

This page was built for publication: Thompson sampling-based recursive block elimination for dynamic assignment under limited budget in pure-exploration

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