Efficient crowdsourcing of unknown experts using bounded multi-armed bandits
type: Item
instance of: scholarly article
title: Efficient crowdsourcing of unknown experts using bounded multi-armed bandits
zbMATH Open document ID: 1405.68309
author: Long Tran-Thanh
author: S. Stein
author: Alex Rogers
author: Nicholas R. Jennings
published in: Artificial Intelligence
publication date: 2014-06-16T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 90B70
Mathematics Subject Classification ID: 91A60
zbMATH DE Number: 6304848
zbMATH Keywords: crowdsourcing
zbMATH Keywords: machine learning
zbMATH Keywords: multi-armed bandits
zbMATH Keywords: budget limitation
MaRDI profile type: Publication
full work available at URL: j.artint.2014.04.005
OpenAlex ID: W2150638405
cites work: Sample mean based index policies by O(log n) regret for the multi-armed bandit problem
cites work: Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part II: Markovian rewards
cites work: Finite-time analysis of the multiarmed bandit problem
cites work: Pure Exploration in Multi-armed Bandits Problems
cites work: Multi-armed Bandits with Metric Switching Costs
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Q4821303
cites work: Q3993418
cites work: Some aspects of the sequential design of experiments
cites work: Q3455612
DOI: 10.1016/J.ARTINT.2014.04.005
description: scientific article; zbMATH DE number 6304848