Efficient crowdsourcing of unknown experts using bounded multi-armed bandits

DOI10.1016/J.ARTINT.2014.04.005MaRDI QIDQ2014933zbMATH OpenOpenAlexFDO

Authors Long Tran-Thanh, S. Stein, Alex Rogers, Nicholas R. Jennings

Publication date 16 June 2014

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2014.04.005

zbMATH Keywords

machine learningmulti-armed banditscrowdsourcingbudget limitation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Theory of organizations, manpower planning in operations research (90B70) Probabilistic games; gambling (91A60)

Recommendations

• Efficient crowdsourcing of unknown experts using multi-armed bandits
• A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing
• Bandit-based task assignment for heterogeneous crowdsourcing
• Adaptive contract design for crowdsourcing markets: bandit algorithms for repeated principal-agent problems
• POMDP-based control of workflows for crowdsourcing

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part II: Markovian rewards
• Efficient crowdsourcing of unknown experts using multi-armed bandits
• Finite-time analysis of the multiarmed bandit problem
• Multi-armed Bandits with Metric Switching Costs
• Probability Inequalities for Sums of Bounded Random Variables
• Pure exploration in multi-armed bandits problems
• Sample mean based index policies by O(log n) regret for the multi-armed bandit problem
• Some aspects of the sequential design of experiments

Cited in

(13)

• Bandit-based task assignment for heterogeneous crowdsourcing
• Fine-grained job salary benchmarking with a nonparametric Dirichlet process-based latent factor model
• Quality-aware online task assignment mechanisms using latent topic model
• A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing
• Incentivizing exploration with heterogeneous value of money
• Data centric workflows for crowdsourcing
• Efficient crowdsourcing of unknown experts using multi-armed bandits
• Adaptive contract design for crowdsourcing markets: bandit algorithms for repeated principal-agent problems
• An optimal bidimensional multi-armed bandit auction for multi-unit procurement
• Optimal permutation estimation in crowdsourcing problems
• On the capacity of information processing systems
• Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback
• Truthful learning mechanisms for multi-slot sponsored search auctions with externalities

This page was built for publication: Efficient crowdsourcing of unknown experts using bounded multi-armed bandits

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