{"id":"https://openalex.org/W1516295474","doi":"https://doi.org/10.23919/ecc.2013.6669260","title":"A decentralized algorithm for the preferred assignment problem in multi-agent systems","display_name":"A decentralized algorithm for the preferred assignment problem in multi-agent systems","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W1516295474","doi":"https://doi.org/10.23919/ecc.2013.6669260","mag":"1516295474"},"language":"en","primary_location":{"id":"doi:10.23919/ecc.2013.6669260","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc.2013.6669260","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 European Control Conference (ECC)","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/A5008023998","display_name":"Usman A. Khany","orcid":null},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Usman A. Khany","raw_affiliation_strings":["Tufts University, Medford, MA, US","[Dept. of Electr. & Comput. Eng., Tufts Univ., Medford, MA, USA]"],"affiliations":[{"raw_affiliation_string":"Tufts University, Medford, MA, US","institution_ids":["https://openalex.org/I121934306"]},{"raw_affiliation_string":"[Dept. of Electr. & Comput. Eng., Tufts Univ., Medford, MA, USA]","institution_ids":["https://openalex.org/I121934306"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077268766","display_name":"Soummya Kar","orcid":"https://orcid.org/0000-0002-8060-5581"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Soummya Karz","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, US","Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, , USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, US","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, , USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008023998"],"corresponding_institution_ids":["https://openalex.org/I121934306"],"apc_list":null,"apc_paid":null,"fwci":1.0873,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78502381,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"766","last_page":"771"},"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.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/T10249","display_name":"Distributed Control Multi-Agent Systems","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/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9848999977111816,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6845946311950684},{"id":"https://openalex.org/keywords/generality","display_name":"Generality","score":0.6183148622512817},{"id":"https://openalex.org/keywords/swap","display_name":"Swap (finance)","score":0.6112244725227356},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.5924078226089478},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5732265710830688},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5530216097831726},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5308443307876587},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5164482593536377},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4304758310317993},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.429345965385437},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3561439514160156},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2269470989704132},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.14696621894836426}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6845946311950684},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.6183148622512817},{"id":"https://openalex.org/C99821215","wikidata":"https://www.wikidata.org/wiki/Q1136583","display_name":"Swap (finance)","level":2,"score":0.6112244725227356},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.5924078226089478},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5732265710830688},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5530216097831726},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5308443307876587},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5164482593536377},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4304758310317993},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.429345965385437},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3561439514160156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2269470989704132},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14696621894836426},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/ecc.2013.6669260","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc.2013.6669260","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 European Control Conference (ECC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1521902942","https://openalex.org/W2003346154","https://openalex.org/W2053913299","https://openalex.org/W2053923031","https://openalex.org/W2057869046","https://openalex.org/W2074796812","https://openalex.org/W2081877251","https://openalex.org/W2113257089","https://openalex.org/W2117905067","https://openalex.org/W2119120935","https://openalex.org/W2128928412","https://openalex.org/W2135132740","https://openalex.org/W2142544818","https://openalex.org/W2153159477","https://openalex.org/W2222512263","https://openalex.org/W2543118732","https://openalex.org/W3104550706"],"related_works":["https://openalex.org/W2045049461","https://openalex.org/W1978893398","https://openalex.org/W2201908702","https://openalex.org/W4381094582","https://openalex.org/W2369625323","https://openalex.org/W2364579609","https://openalex.org/W1977906818","https://openalex.org/W1522139108","https://openalex.org/W2353528968","https://openalex.org/W2032776242"],"abstract_inverted_index":{"In":[0,117,145],"this":[1,118,126,193,208],"paper,":[2,119],"we":[3,30,75,120,131,147,185],"consider":[4,121],"a":[5,19,26,36,39,153,187],"task-allocation":[6],"problem":[7,81],"where":[8],"N":[9,15],"agents":[10,23],"are":[11],"to":[12,86,104,213],"be":[13,159],"assigned":[14],"distinct":[16,40],"tasks":[17],"without":[18,44],"central":[20],"coordinator.":[21],"The":[22,205],"communicate":[24],"over":[25],"connected":[27],"network":[28,135,183],"and":[29,53,102,161,174,190],"assume":[31,132,148],"that":[32,65,133,149,156,192],"each":[33,66,150,162],"agent":[34,48,67,151,163],"has":[35,152],"preference":[37,168],"for":[38],"unique":[41,92,115,143,154],"task,":[42,74],"i.e.,":[43,130],"loss":[45],"of":[46,90,97,113,125,140,217],"generality,":[47],"i":[49,52],"prefers":[50],"task":[51,59,155,173],"is":[54,136,210],"unhappy":[55],"with":[56],"any":[57],"other":[58],"(\u2260":[60],"i).":[61],"With":[62],"the":[63,78,88,95,106,111,122,134,141,172,182,196,215,218],"assumption":[64],"starts":[68],"by":[69],"picking":[70],"an":[71],"arbitrary":[72],"random":[73],"can":[76],"divide":[77],"preferred":[79,108,127,160,197],"taskallocation":[80],"into":[82],"two":[83],"phases:":[84],"(i)":[85,220],"reach":[87,105],"set":[89,96,112],"N!":[91,114,142],"assignments":[93],"from":[94,110],"NN":[98],"total":[99],"configurations-presented":[100],"elsewhere;":[101],"(ii)":[103,124],"single":[107],"assignment":[109,128,198,221],"configurations.":[116,144],"phase":[123,219],"problem,":[129],"already":[137],"in":[138,199,207],"one":[139],"particular,":[146],"may":[157],"not":[158,165],"does":[164],"know":[166],"its":[167,176],"until":[169],"it":[170],"sees":[171],"evaluates":[175],"cost.":[177],"Under":[178],"mild":[179],"conditions":[180],"on":[181],"connectivity,":[184],"propose":[186],"swap-stick":[188],"algorithm":[189,194],"show":[191,214],"reaches":[195],"finite-time":[200],"(a.s.)":[201],"using":[202],"Markov-chain":[203],"arguments.":[204],"analysis":[206],"paper":[209],"further":[211],"extendable":[212],"convergence":[216],"problem.":[222]},"counts_by_year":[{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}