Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 49559 (19)
- University: Sharif University of Technology
- Department: Computer Engineering
- Advisor(s): Ghodsi, Mohammad
- Abstract:
- Nowadays, we observe the growth in the number of mobile smart phones. These smart phones have had an impressive progress in software and hardware. Many studies have focused on utilizing this new platform. One of these areas of research is collecting information from environment.Two major challenges for a successful crowdsourcing system are engaging a sufficient number of workers and validating of their registered data, which make the system more reliable. Collecting data from different points of a territory can be defined as some tasks and should be assigned to users near those tasks properly. Some users want a monetary reward for the cost they incur. On the other hand, information requesters have limited budget and want the maximum number of task assignment under the limited budget. Mechanism design is a proper approach for these kinds of problems.In this research, after introducing crowdsourcing, we focus on the problem of assigning spatial tasks to spatial workers, considering the quality of submitted data.We suggest a truthful, individually-rational and budget-feasible mechanism. Furthermore, we also show that this problem is NP-hard in general case. In this study, first we solve the one-imensional version of the problem in which tasks and workers are located in a line, and give a 2,3,6 approximation mechanism. After that, we suggest a mechanism with 12-approximation factor for the 2-dimensional version, the general form of the problem
- Keywords:
- Mechanism Design ; Approximate Algorithm ; Algorithmic Game Theory ; Crowdsourcing ; Spatial Crowdsourcing
Digital Object List
محتواي کتاب
Bookmark