{"id":"https://openalex.org/W3010019765","doi":"https://doi.org/10.1109/globecom38437.2019.9013143","title":"Joint Optimization of System and User Oriented Task Assignment in Mobile Crowdsensing","display_name":"Joint Optimization of System and User Oriented Task Assignment in Mobile Crowdsensing","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3010019765","doi":"https://doi.org/10.1109/globecom38437.2019.9013143","mag":"3010019765"},"language":"en","primary_location":{"id":"doi:10.1109/globecom38437.2019.9013143","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom38437.2019.9013143","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5050214946","display_name":"Fatih Y\u00fccel","orcid":"https://orcid.org/0000-0002-4910-5351"},"institutions":[{"id":"https://openalex.org/I184840846","display_name":"Virginia Commonwealth University","ror":"https://ror.org/02nkdxk79","country_code":"US","type":"education","lineage":["https://openalex.org/I184840846"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fatih Yucel","raw_affiliation_strings":["Department of Computer Science, Virginia Commonwealth University, VA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Virginia Commonwealth University, VA, USA","institution_ids":["https://openalex.org/I184840846"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004397715","display_name":"Eyuphan Bulut","orcid":"https://orcid.org/0000-0003-4744-9211"},"institutions":[{"id":"https://openalex.org/I184840846","display_name":"Virginia Commonwealth University","ror":"https://ror.org/02nkdxk79","country_code":"US","type":"education","lineage":["https://openalex.org/I184840846"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eyuphan Bulut","raw_affiliation_strings":["Department of Computer Science, Virginia Commonwealth University, VA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Virginia Commonwealth University, VA, USA","institution_ids":["https://openalex.org/I184840846"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I184840846"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":1.0,"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/T10326","display_name":"Indoor and Outdoor Localization Technologies","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9853000044822693,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision 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.7578014135360718},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.7443662881851196},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6651495695114136},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.6536729335784912},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.6408845782279968},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6232541799545288},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6037696599960327},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5289421677589417},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5151902437210083},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.47762078046798706},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.457705020904541},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4284762740135193},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.41554561257362366},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3754729926586151},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2526112198829651},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17108497023582458},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10492590069770813},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08761870861053467}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7578014135360718},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.7443662881851196},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6651495695114136},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.6536729335784912},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.6408845782279968},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6232541799545288},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6037696599960327},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5289421677589417},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5151902437210083},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.47762078046798706},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.457705020904541},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4284762740135193},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41554561257362366},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3754729926586151},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2526112198829651},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17108497023582458},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10492590069770813},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08761870861053467},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/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.1109/globecom38437.2019.9013143","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom38437.2019.9013143","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1507039213","https://openalex.org/W2068115726","https://openalex.org/W2073061255","https://openalex.org/W2079204536","https://openalex.org/W2125826911","https://openalex.org/W2175150243","https://openalex.org/W2222512263","https://openalex.org/W2405686381","https://openalex.org/W2464440734","https://openalex.org/W2579477926","https://openalex.org/W2604253054","https://openalex.org/W2783217174","https://openalex.org/W2790916389","https://openalex.org/W2792859805","https://openalex.org/W2887074406","https://openalex.org/W3099118774","https://openalex.org/W4246219036","https://openalex.org/W4291745967"],"related_works":["https://openalex.org/W2937059810","https://openalex.org/W1586515950","https://openalex.org/W2379349345","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2382974548","https://openalex.org/W3086805279","https://openalex.org/W2109912052","https://openalex.org/W1711527768","https://openalex.org/W2135219659"],"abstract_inverted_index":{"One":[0],"of":[1,22,35,65,109,112,140],"the":[2,17,28,33,46,63,68,72,90,102,107,125,134,161,168,194,198],"fundamental":[3],"challenges":[4],"in":[5,67,84,129,213],"mobile":[6],"crowdsensing":[7],"(MCS)":[8],"systems":[9,131],"is":[10,117,163],"efficient":[11],"task":[12,40,51,116,126],"assignment.":[13,159],"Existing":[14],"solutions":[15,78],"consider":[16,45],"problem":[18,128,162,169],"from":[19],"system's":[20],"point":[21],"view":[23],"and":[24,50,54,142,176,206],"try":[25],"to":[26,82,208],"maximize":[27],"system":[29,103,136,147,201],"utility":[30,104,137,202],"or":[31],"minimize":[32],"cost":[34],"sensing.":[36],"However,":[37,97],"such":[38],"a":[39,146,180],"assignment":[41,127],"process":[42],"does":[43],"not":[44],"user":[47,73,210],"(i.e.,":[48,138],"workers":[49,113,141],"requesters)":[52],"preferences":[53],"can":[55,79],"yield":[56],"unhappy":[57],"users":[58,66,91,154],"with":[59,157],"their":[60,95,158],"assignments,":[61],"impairing":[62],"participation":[64],"future.":[69],"To":[70,119],"incentivize":[71],"participation,":[74],"stable":[75],"matching":[76],"based":[77,93,182],"be":[80],"utilized":[81],"result":[83],"satisfactory":[85],"assignments":[86],"that":[87,132,185,193],"will":[88],"make":[89],"happy":[92,153],"on":[94],"preferences.":[96],"this":[98,121],"may":[99],"adversely":[100],"affect":[101],"especially":[105],"when":[106],"set":[108],"eligible":[110],"number":[111,139],"for":[114],"each":[115],"limited.":[118],"address":[120],"issue,":[122],"we":[123,165,178,191],"study":[124],"MCS":[130],"maximizes":[133],"main":[135],"tasks":[143],"assigned)":[144],"as":[145,152,155,212],"oriented":[148],"goal":[149],"while":[150,203],"generating":[151,204],"possible":[156,200],"As":[160],"NP-complete,":[164],"first":[166],"solve":[167],"optimally":[170],"using":[171],"Integer":[172],"Linear":[173],"Programming":[174],"(ILP)":[175],"then":[177],"propose":[179],"heuristic":[181],"polynomial":[183],"solution":[184],"runs":[186],"very":[187],"fast.":[188],"Through":[189],"simulations,":[190],"show":[192],"proposed":[195],"approach":[196],"achieves":[197],"maximum":[199],"small":[205],"close":[207],"optimal":[209],"unhappiness":[211],"ILP":[214],"results.":[215]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}