{"id":"https://openalex.org/W2769878314","doi":"https://doi.org/10.1109/tro.2018.2858292","title":"Anonymous Hedonic Game for Task Allocation in a Large-Scale Multiple Agent System","display_name":"Anonymous Hedonic Game for Task Allocation in a Large-Scale Multiple Agent System","publication_year":2018,"publication_date":"2018-08-20","ids":{"openalex":"https://openalex.org/W2769878314","doi":"https://doi.org/10.1109/tro.2018.2858292","mag":"2769878314"},"language":"en","primary_location":{"id":"doi:10.1109/tro.2018.2858292","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2018.2858292","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1546-1904","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1711.06871","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Inmo Jang","orcid":"https://orcid.org/0000-0002-7492-3938"},"institutions":[{"id":"https://openalex.org/I82284825","display_name":"Cranfield University","ror":"https://ror.org/05cncd958","country_code":"GB","type":"education","lineage":["https://openalex.org/I82284825"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Inmo Jang","raw_affiliation_strings":["Centre for Autonomous and Cyber-Physical Systems, Cranfield University, Bedford, U.K"],"raw_orcid":"https://orcid.org/0000-0002-7492-3938","affiliations":[{"raw_affiliation_string":"Centre for Autonomous and Cyber-Physical Systems, Cranfield University, Bedford, U.K","institution_ids":["https://openalex.org/I82284825"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Hyo-Sang Shin","orcid":"https://orcid.org/0000-0001-9938-0370"},"institutions":[{"id":"https://openalex.org/I82284825","display_name":"Cranfield University","ror":"https://ror.org/05cncd958","country_code":"GB","type":"education","lineage":["https://openalex.org/I82284825"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Hyo-Sang Shin","raw_affiliation_strings":["Centre for Autonomous and Cyber-Physical Systems, Cranfield University, Bedford, U.K"],"raw_orcid":"https://orcid.org/0000-0001-9938-0370","affiliations":[{"raw_affiliation_string":"Centre for Autonomous and Cyber-Physical Systems, Cranfield University, Bedford, U.K","institution_ids":["https://openalex.org/I82284825"]}]},{"author_position":"last","author":{"id":null,"display_name":"Antonios Tsourdos","orcid":"https://orcid.org/0000-0002-3966-7633"},"institutions":[{"id":"https://openalex.org/I82284825","display_name":"Cranfield University","ror":"https://ror.org/05cncd958","country_code":"GB","type":"education","lineage":["https://openalex.org/I82284825"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Antonios Tsourdos","raw_affiliation_strings":["Centre for Autonomous and Cyber-Physical Systems, Cranfield University, Bedford, U.K"],"raw_orcid":"https://orcid.org/0000-0002-3966-7633","affiliations":[{"raw_affiliation_string":"Centre for Autonomous and Cyber-Physical Systems, Cranfield University, Bedford, U.K","institution_ids":["https://openalex.org/I82284825"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I82284825"],"apc_list":null,"apc_paid":null,"fwci":5.14,"has_fulltext":false,"cited_by_count":106,"citation_normalized_percentile":{"value":0.95316105,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"34","issue":"6","first_page":"1534","last_page":"1548"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.6733999848365784,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.6733999848365784,"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/T11031","display_name":"Game Theory and Applications","score":0.120899997651577,"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"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.045499999076128006,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6039999723434448},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.550599992275238},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.5497999787330627},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5375999808311462},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5195000171661377},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.49129998683929443},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.47290000319480896},{"id":"https://openalex.org/keywords/potential-game","display_name":"Potential game","score":0.41850000619888306},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4097000062465668},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.3853999972343445}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6840999722480774},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6039999723434448},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.550599992275238},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.5497999787330627},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5375999808311462},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5195000171661377},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.49129998683929443},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.47290000319480896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46709999442100525},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45590001344680786},{"id":"https://openalex.org/C2778079155","wikidata":"https://www.wikidata.org/wiki/Q288500","display_name":"Potential game","level":3,"score":0.41850000619888306},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4097000062465668},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.3853999972343445},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.3783000111579895},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.3758000135421753},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.3725999891757965},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3619000017642975},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.36000001430511475},{"id":"https://openalex.org/C13687954","wikidata":"https://www.wikidata.org/wiki/Q4826847","display_name":"Autonomous agent","level":2,"score":0.33640000224113464},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.335999995470047},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.31630000472068787},{"id":"https://openalex.org/C107257861","wikidata":"https://www.wikidata.org/wiki/Q656316","display_name":"Coordination game","level":2,"score":0.3109999895095825},{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.30320000648498535},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.28949999809265137},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C82149807","wikidata":"https://www.wikidata.org/wiki/Q7242623","display_name":"Price of anarchy","level":4,"score":0.2870999872684479},{"id":"https://openalex.org/C2780860992","wikidata":"https://www.wikidata.org/wiki/Q16887485","display_name":"Network partition","level":2,"score":0.28519999980926514},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.28029999136924744},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.27149999141693115},{"id":"https://openalex.org/C4727928","wikidata":"https://www.wikidata.org/wiki/Q17164759","display_name":"Social network (sociolinguistics)","level":3,"score":0.26190000772476196},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.2578999996185303},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2531999945640564},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.2531000077724457},{"id":"https://openalex.org/C33962884","wikidata":"https://www.wikidata.org/wiki/Q378637","display_name":"Dynamical system (definition)","level":3,"score":0.250900000333786}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/tro.2018.2858292","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2018.2858292","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1546-1904","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/3be82b87-4094-4b70-af60-8637e2fc559f","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/3be82b87-4094-4b70-af60-8637e2fc559f","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jang, I, Shin, H S & Tsourdos, A 2018, 'Anonymous Hedonic Game for Task Allocation in a Large-Scale Multiple Agent System', IEEE Transactions on Robotics, vol. 34, no. 6, pp. 1534-1548. https://doi.org/10.1109/TRO.2018.2858292","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:arXiv.org:1711.06871","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1711.06871","pdf_url":"https://arxiv.org/pdf/1711.06871","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:dspace.lib.cranfield.ac.uk:1826/13453","is_oa":true,"landing_page_url":"https://dspace.lib.cranfield.ac.uk/handle/1826/13453","pdf_url":null,"source":{"id":"https://openalex.org/S4306401778","display_name":"CERES (Cranfield University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I82284825","host_organization_name":"Cranfield University","host_organization_lineage":["https://openalex.org/I82284825"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:pure.atira.dk:publications/3be82b87-4094-4b70-af60-8637e2fc559f","is_oa":false,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/anonymous-hedonic-game-for-task-allocation-in-a-largescale-multiple-agent-system(3be82b87-4094-4b70-af60-8637e2fc559f).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jang, I, Shin, H S & Tsourdos, A 2018, 'Anonymous Hedonic Game for Task Allocation in a Large-Scale Multiple Agent System', IEEE Transactions on Robotics, vol. 34, no. 6, pp. 1534-1548. https://doi.org/10.1109/TRO.2018.2858292","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1711.06871","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1711.06871","pdf_url":"https://arxiv.org/pdf/1711.06871","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5750461065","display_name":null,"funder_award_id":"EFA3004Z","funder_id":"https://openalex.org/F4320321204","funder_display_name":"Chungnam National University"}],"funders":[{"id":"https://openalex.org/F4320321204","display_name":"Chungnam National University","ror":"https://ror.org/0227as991"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W1471578414","https://openalex.org/W1521448640","https://openalex.org/W1574658980","https://openalex.org/W1575545465","https://openalex.org/W1587920257","https://openalex.org/W1969653154","https://openalex.org/W1972391046","https://openalex.org/W1988853707","https://openalex.org/W2001337929","https://openalex.org/W2014403316","https://openalex.org/W2016947536","https://openalex.org/W2023510972","https://openalex.org/W2030775133","https://openalex.org/W2038847765","https://openalex.org/W2038992031","https://openalex.org/W2044553168","https://openalex.org/W2052064204","https://openalex.org/W2070449754","https://openalex.org/W2083641861","https://openalex.org/W2089077607","https://openalex.org/W2089312859","https://openalex.org/W2096440680","https://openalex.org/W2099996866","https://openalex.org/W2100903798","https://openalex.org/W2108765649","https://openalex.org/W2116729592","https://openalex.org/W2118331730","https://openalex.org/W2134660637","https://openalex.org/W2135630914","https://openalex.org/W2138165608","https://openalex.org/W2140666908","https://openalex.org/W2141263345","https://openalex.org/W2142544818","https://openalex.org/W2145510175","https://openalex.org/W2149902396","https://openalex.org/W2156371707","https://openalex.org/W2157488300","https://openalex.org/W2171692416","https://openalex.org/W2202942124","https://openalex.org/W2238304881","https://openalex.org/W2322076341","https://openalex.org/W2334090071","https://openalex.org/W2405120882","https://openalex.org/W2500623409","https://openalex.org/W2571149404","https://openalex.org/W2575523922","https://openalex.org/W2766857868","https://openalex.org/W2963546922","https://openalex.org/W4253646082","https://openalex.org/W6618524550","https://openalex.org/W6629675267","https://openalex.org/W6677884629","https://openalex.org/W6678501250","https://openalex.org/W6682013967"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,11,16,42,66,79,139],"novel":[4],"game-theoretical":[5],"autonomous":[6],"decision-making":[7],"framework":[8,127],"to":[9,41,112],"address":[10],"task":[12],"allocation":[13],"problem":[14],"for":[15,82],"swarm":[17],"of":[18,24,36,87,89,99,115,120],"multiple":[19],"agents.":[20,117],"We":[21,76],"consider":[22],"cooperation":[23],"self-interested":[25],"agents,":[26],"and":[27,56,71,92,135],"show":[28,94],"that":[29,95,124],"our":[30],"proposed":[31,126],"decentralized":[32],"algorithm":[33,53],"guarantees":[34],"convergence":[35],"agents":[37,64],"with":[38,62,110],"social":[39,47,105],"inhibition":[40],"Nash":[43],"stable":[44],"partition":[45],"(i.e.,":[46],"agreement)":[48],"within":[49],"polynomial":[50],"time.":[51],"The":[52,118],"is":[54,128],"simple":[55],"executable":[57],"based":[58],"on":[59],"local":[60],"interactions":[61],"neighbor":[63],"under":[65],"strongly":[67],"connected":[68],"communication":[69],"network":[70],"even":[72,137],"in":[73,138],"asynchronous":[74],"environments.":[75],"analytically":[77],"present":[78],"mathematical":[80],"formulation":[81],"computing":[83],"the":[84,90,113,125],"lower":[85],"bound":[86],"suboptimality":[88,100],"outcome,":[91],"additionally":[93],"at":[96],"least":[97],"50%":[98],"can":[101],"be":[102],"guaranteed":[103],"if":[104],"utilities":[106],"are":[107],"nondecreasing":[108],"functions":[109],"respect":[111],"number":[114],"coworking":[116],"results":[119],"numerical":[121],"experiments":[122],"confirm":[123],"scalable,":[129],"fast":[130],"adaptable":[131],"against":[132],"dynamical":[133],"environments,":[134],"robust":[136],"realistic":[140],"situation.":[141]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":20},{"year":2024,"cited_by_count":27},{"year":2023,"cited_by_count":16},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":18},{"year":2020,"cited_by_count":9},{"year":2018,"cited_by_count":3}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2017-12-04T00:00:00"}