Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/87464
Title: Learning-based mechanism design for microtask crowdsourcing
Authors: Hu, Zehong
Keywords: DRNTU::Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence
Issue Date: 30-Nov-2018
Source: Hu, Z. (2018). Learning-based mechanism design for microtask crowdsourcing. Doctoral thesis, Nanyang Technological University, Singapore.
Abstract: Microtask crowdsourcing, as an efficient and economical method for a requester to outsource tasks to online workers, is becoming increasingly popular in many domains, especially collecting labels for large-scale datasets. In microtask crowdsourcing, a requester usually needs to accomplish three steps: firstly, recruit as many as possible workers from the market; then, assign tasks to the workers based on their performance; lastly, reward good workers and meanwhile punish bad workers. For these three steps, various mechanisms have been proposed. Under certain assumptions about workers' responses to the rewards, these mechanisms can theoretically ensure workers to follow the strategies desired by the requester and thus maximize the revenue of the requester. However, these assumptions may be violated in practice, which causes the failure of these theoretically elegant mechanisms. Thereby, recent studies move their focus to the learning-based mechanisms which learn workers' models in an online fashion rather than simply assuming one. In this thesis, we propose three novel learning-based mechanisms, each for one step, to push forward the studies in this direction.
URI: https://hdl.handle.net/10356/87464
http://hdl.handle.net/10220/46752
DOI: https://doi.org/10.32657/10220/46752
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Theses

Files in This Item:
File Description SizeFormat 
Thesis.pdfThesis2.06 MBAdobe PDFThumbnail
View/Open

Google ScholarTM

Check

Altmetric

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.