Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems 2018
DOI: 10.1145/3274895.3274981
|View full text |Cite
|
Sign up to set email alerts
|

In-route task selection in crowdsourcing

Abstract: One important problem in crowdsourcing is that of assigning tasks to workers. We consider a scenario where a worker is traveling on a preferred/typical path (e.g., from school to home) and there is a set of tasks available to be performed. Furthermore, we assume that: each task yields a positive reward, the worker has the skills necessary to perform all available tasks and he/she is willing to possibly deviate from his/her preferred path as long as he/she travels at most a total given distance/time. We call th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…To reduce the uncertainty in the online task assignment scenario, SC-server can exploit the workers' movement information to identify the workers' arrival order [8]. There are some existing works [2,4,13], that try to harness the workers' movement information. For instance, [4] tries to solve a single-worker-multiple-tasks type of task scheduling problem.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…To reduce the uncertainty in the online task assignment scenario, SC-server can exploit the workers' movement information to identify the workers' arrival order [8]. There are some existing works [2,4,13], that try to harness the workers' movement information. For instance, [4] tries to solve a single-worker-multiple-tasks type of task scheduling problem.…”
Section: Related Workmentioning
confidence: 99%
“…There are some existing works [2,4,13], that try to harness the workers' movement information. For instance, [4] tries to solve a single-worker-multiple-tasks type of task scheduling problem. They assume that there are a set of available tasks that have to be incorporated into the worker's route based on her budget on a detour.…”
Section: Related Workmentioning
confidence: 99%