{"id":"https://openalex.org/W4386507472","doi":"https://doi.org/10.1145/3605731.3605873","title":"Utility-Based Task Assignment for ON-based Mobile Crowdsourcing","display_name":"Utility-Based Task Assignment for ON-based Mobile Crowdsourcing","publication_year":2023,"publication_date":"2023-08-07","ids":{"openalex":"https://openalex.org/W4386507472","doi":"https://doi.org/10.1145/3605731.3605873"},"language":"en","primary_location":{"id":"doi:10.1145/3605731.3605873","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1145/3605731.3605873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd International Conference on Parallel Processing Workshops","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102709220","display_name":"Kazuya Sakai","orcid":"https://orcid.org/0000-0003-3929-2533"},"institutions":[{"id":"https://openalex.org/I69740276","display_name":"Tokyo Metropolitan University","ror":"https://ror.org/00ws30h19","country_code":"JP","type":"education","lineage":["https://openalex.org/I69740276"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Kazuya Sakai","raw_affiliation_strings":["Department of Computer Science and Electrical Engineering, Tokyo Metropolitan University, Japan"],"raw_orcid":"https://orcid.org/0000-0003-3929-2533","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Electrical Engineering, Tokyo Metropolitan University, Japan","institution_ids":["https://openalex.org/I69740276"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060250892","display_name":"Min-Te Sun","orcid":"https://orcid.org/0000-0002-8911-3831"},"institutions":[{"id":"https://openalex.org/I22265921","display_name":"National Central University","ror":"https://ror.org/00944ve71","country_code":"TW","type":"education","lineage":["https://openalex.org/I22265921"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Min-Te Sun","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Centrali University, Taiwan"],"raw_orcid":"https://orcid.org/0000-0002-8911-3831","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Centrali University, Taiwan","institution_ids":["https://openalex.org/I22265921"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102709220"],"corresponding_institution_ids":["https://openalex.org/I69740276"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13268934,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"8","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8038457632064819},{"id":"https://openalex.org/keywords/crowdsourcing","display_name":"Crowdsourcing","score":0.7779554128646851},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.7302924394607544},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.6283080577850342},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.5888590812683105},{"id":"https://openalex.org/keywords/stochastic-game","display_name":"Stochastic game","score":0.5690443515777588},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5058455467224121},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.49280980229377747},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.48125264048576355},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.47208425402641296},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.45095646381378174},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4405675232410431},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3361620604991913},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33368849754333496},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32660380005836487},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3100799322128296},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23376956582069397},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1497594118118286},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.07570600509643555},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07384827733039856}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8038457632064819},{"id":"https://openalex.org/C62230096","wikidata":"https://www.wikidata.org/wiki/Q275969","display_name":"Crowdsourcing","level":2,"score":0.7779554128646851},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.7302924394607544},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.6283080577850342},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.5888590812683105},{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.5690443515777588},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5058455467224121},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.49280980229377747},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.48125264048576355},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.47208425402641296},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.45095646381378174},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4405675232410431},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3361620604991913},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33368849754333496},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32660380005836487},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3100799322128296},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23376956582069397},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1497594118118286},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.07570600509643555},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07384827733039856},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3605731.3605873","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1145/3605731.3605873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd International Conference on Parallel Processing Workshops","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5199999809265137,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1593284348","https://openalex.org/W1977093441","https://openalex.org/W2028922670","https://openalex.org/W2133255965","https://openalex.org/W2157861192","https://openalex.org/W2324695044","https://openalex.org/W2339403638","https://openalex.org/W2470239497","https://openalex.org/W2562814954","https://openalex.org/W2761037016","https://openalex.org/W2886007782","https://openalex.org/W2944810452","https://openalex.org/W2945392577","https://openalex.org/W2945913968","https://openalex.org/W3002405259","https://openalex.org/W3014064543","https://openalex.org/W3119562986","https://openalex.org/W3130749731","https://openalex.org/W3217779635","https://openalex.org/W4366967222"],"related_works":["https://openalex.org/W2937059810","https://openalex.org/W1586515950","https://openalex.org/W2379349345","https://openalex.org/W2382974548","https://openalex.org/W3086805279","https://openalex.org/W2135219659","https://openalex.org/W1976256054","https://openalex.org/W2760584304","https://openalex.org/W2358965113","https://openalex.org/W1971278768"],"abstract_inverted_index":{"In":[0],"this":[1,99],"paper":[2],"we":[3,101],"are":[4,58],"interested":[5],"in":[6,98],"opportunistic":[7],"network-based":[8],"(ON-based)":[9],"mobile":[10],"crowdsourcing":[11],"(MCS),":[12],"where":[13,91],"a":[14,17,20,25,87,110,147],"requester":[15],"(called":[16],"server)":[18],"assigns":[19,133],"set":[21],"of":[22,27,75,140,165],"tasks":[23,35,134],"to":[24,40,48,61,68,135],"pool":[26],"workers,":[28],"and":[29,153],"the":[30,33,63,70,73,83,104,118,128,141,154,159,163,166],"workers":[31],"process":[32],"assigned":[34],"for":[36,114],"payoff.":[37],"The":[38,53,138],"key":[39],"success":[41],"such":[42],"an":[43],"ON-based":[44,115],"MCS":[45],"is":[46,79,124,144],"how":[47],"design":[49],"task":[50,55,64,84,92,106,120,169],"assignment":[51,56,85,107,121,170],"strategy.":[52],"existing":[54,167],"algorithms":[57],"primarily":[59],"designed":[60],"maximize":[62],"completion":[65],"rate":[66],"or":[67],"minimize":[69],"makespan.":[71],"To":[72],"best":[74],"our":[76],"knowledge,":[77],"there":[78],"no":[80],"work":[81],"on":[82,127],"with":[86,109],"time-decaying":[88,111],"utility":[89,93,112],"model,":[90],"decreases":[94],"over":[95],"time.":[96],"Therefore,":[97],"paper,":[100],"first":[102],"introduce":[103],"utility-based":[105,119],"problem":[108],"model":[113],"MCS.":[116],"Then,":[117],"(UTA)":[122],"algorithm":[123],"proposed":[125,142,160],"based":[126],"greedy":[129],"strategy":[130],"that":[131,158],"dynamically":[132],"contacted":[136],"workers.":[137],"performance":[139],"scheme":[143],"evaluated":[145],"using":[146],"real":[148],"mobility":[149],"trace,":[150],"called":[151],"CRAWDAD,":[152],"simulation":[155],"results":[156],"demonstrate":[157],"UTA":[161],"outperforms":[162],"one":[164],"online":[168],"algorithms.":[171]},"counts_by_year":[],"updated_date":"2025-12-22T23:10:17.713674","created_date":"2025-10-10T00:00:00"}