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

DOI10.1007/S10618-024-01083-2MaRDI QIDQ6663814

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

Publication date: 15 January 2025

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

zbMATH Keywords

dynamic pricingdynamic assignmentmulti-armed banditssequential learningThompson samplinglearning with feedbackpure-exploration

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pure exploration in finitely-armed and continuous-armed bandits
• On Sequential Elimination Algorithms for Best-Arm Identification in Multi-Armed Bandits
• The Nonstochastic Multiarmed Bandit Problem
• Bandit Algorithms
• Bandits and Experts in Metric Spaces
• Prediction, Learning, and Games
• Finite-time analysis of the 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)