A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing

DOI10.1016/j.artint.2017.10.001zbMath1423.68453OpenAlexW2768217841MaRDI QIDQ1690964

Satyanath Bhat, Shweta Jain, Sujit Gujar, Yadati Narahari, Onno R. Zoeter

Publication date: 12 January 2018

Published in: Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

mechanism designcrowdsourcingmulti-armed bandit

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Stopping times; optimal stopping problems; gambling theory (60G40) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Crowdsourcing with unsure option ⋮ An optimal bidimensional multi-armed bandit auction for multi-unit procurement ⋮ A Differential Privacy Mechanism that Accounts for Network Effects for Crowdsourcing Systems ⋮ Ballooning multi-armed bandits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Truthful learning mechanisms for multi-slot sponsored search auctions with externalities
• Asymptotically efficient adaptive allocation rules
• Efficient crowdsourcing of unknown experts using bounded multi-armed bandits
• Mechanisms with learning for stochastic multi-armed bandit problems
• Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach
• Optimal Auction Design
• Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing