{"id":"https://openalex.org/W2622743094","doi":"https://doi.org/10.1145/2629671","title":"Distributed Selfish Load Balancing on Networks","display_name":"Distributed Selfish Load Balancing on Networks","publication_year":2014,"publication_date":"2014-08-11","ids":{"openalex":"https://openalex.org/W2622743094","doi":"https://doi.org/10.1145/2629671","mag":"2622743094"},"language":"en","primary_location":{"id":"doi:10.1145/2629671","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2629671","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-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/A5072910141","display_name":"Petra Berenbrink","orcid":"https://orcid.org/0000-0002-6930-3259"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Petra Berenbrink","raw_affiliation_strings":["Simon Fraser University, Burnaby, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Simon Fraser University, Burnaby, Canada","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065332233","display_name":"Martin Hoefer","orcid":"https://orcid.org/0000-0003-0131-5605"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Hoefer","raw_affiliation_strings":["Max-Planck-Institute for Informatics and Saarland University, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institute for Informatics and Saarland University, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017390373","display_name":"Thomas Sauerwald","orcid":"https://orcid.org/0000-0002-0882-283X"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Thomas Sauerwald","raw_affiliation_strings":["University of Cambridge, Cambridge, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cambridge, Cambridge, UK","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7287,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.81617346,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"11","issue":"1","first_page":"1","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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.9980000257492065,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9973000288009644,"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/nash-equilibrium","display_name":"Nash equilibrium","score":0.800399661064148},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6943192481994629},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5416354537010193},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5401443839073181},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5188716053962708},{"id":"https://openalex.org/keywords/potential-game","display_name":"Potential game","score":0.4960053861141205},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.493431955575943},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4838789701461792},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4836646020412445},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47725746035575867},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.44818755984306335},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4282172918319702},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4199887216091156},{"id":"https://openalex.org/keywords/coordination-game","display_name":"Coordination game","score":0.411964476108551},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3960355520248413},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.26051533222198486},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24851760268211365},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.18565866351127625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12681981921195984}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.800399661064148},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6943192481994629},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5416354537010193},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5401443839073181},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5188716053962708},{"id":"https://openalex.org/C2778079155","wikidata":"https://www.wikidata.org/wiki/Q288500","display_name":"Potential game","level":3,"score":0.4960053861141205},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.493431955575943},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4838789701461792},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4836646020412445},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47725746035575867},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.44818755984306335},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4282172918319702},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4199887216091156},{"id":"https://openalex.org/C107257861","wikidata":"https://www.wikidata.org/wiki/Q656316","display_name":"Coordination game","level":2,"score":0.411964476108551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3960355520248413},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.26051533222198486},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24851760268211365},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.18565866351127625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12681981921195984},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2629671","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2629671","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.7200000286102295}],"awards":[{"id":"https://openalex.org/G1662968737","display_name":null,"funder_award_id":"Ho 3831/3-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G2071040080","display_name":null,"funder_award_id":"CNS-0435060, CCR-0325197 and EN-CS-0329609","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2696118949","display_name":null,"funder_award_id":"CNS-0435060, CCR-0325197 and EN-CS-0329609","funder_id":"https://openalex.org/F4320337388","funder_display_name":"Division of Computer and Network Systems"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320337388","display_name":"Division of Computer and Network Systems","ror":"https://ror.org/02rdzmk74"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1578099820","https://openalex.org/W1909387666","https://openalex.org/W1978317291","https://openalex.org/W1978335532","https://openalex.org/W1979357207","https://openalex.org/W1980101137","https://openalex.org/W1990873282","https://openalex.org/W1996350158","https://openalex.org/W2023434464","https://openalex.org/W2026337277","https://openalex.org/W2031748078","https://openalex.org/W2040570464","https://openalex.org/W2041571902","https://openalex.org/W2050063944","https://openalex.org/W2051206974","https://openalex.org/W2054129049","https://openalex.org/W2058013927","https://openalex.org/W2060084491","https://openalex.org/W2067153340","https://openalex.org/W2072951587","https://openalex.org/W2083562271","https://openalex.org/W2088375330","https://openalex.org/W2090026441","https://openalex.org/W2104708967","https://openalex.org/W2111071057","https://openalex.org/W2120196685","https://openalex.org/W2138627397","https://openalex.org/W2141350198","https://openalex.org/W2153216058","https://openalex.org/W2153541270","https://openalex.org/W2155077468","https://openalex.org/W2166417226","https://openalex.org/W2169139983","https://openalex.org/W2176451521","https://openalex.org/W4241368548"],"related_works":["https://openalex.org/W2100142613","https://openalex.org/W2093123841","https://openalex.org/W4214835929","https://openalex.org/W4210759752","https://openalex.org/W4226086326","https://openalex.org/W2100703460","https://openalex.org/W2098082970","https://openalex.org/W4229858512","https://openalex.org/W2104708967","https://openalex.org/W2622743094"],"abstract_inverted_index":{"We":[0,49],"study":[1],"distributed":[2],"load":[3],"balancing":[4],"in":[5,24,114,118],"networks":[6,146],"with":[7,149],"selfish":[8,31],"agents.":[9,79],"In":[10,102,129],"the":[11,71,89,104,122,126],"simplest":[12],"model":[13],"considered":[14],"here,":[15],"there":[16],"are":[17],"n":[18,30,119],"identical":[19],"machines":[20,148],"represented":[21],"by":[22],"vertices":[23],"a":[25,108],"network":[26],"and":[27,68,70,116,159,167],"m":[28,115],">":[29],"agents":[32,154],"that":[33,56,95,155],"unilaterally":[34],"decide":[35],"to":[36,41,84,93,107,136,145,153,165],"move":[37],"from":[38],"one":[39],"vertex":[40],"another":[42],"if":[43],"this":[44],"improves":[45],"their":[46],"experienced":[47],"load.":[48],"present":[50],"several":[51],"protocols":[52],"for":[53,163],"concurrent":[54],"migration":[55,91],"satisfy":[57,96],"desirable":[58],"properties":[59],"such":[60],"as":[61],"being":[62],"based":[63],"only":[64,112],"on":[65,125],"local":[66],"information":[67],"computation":[69],"absence":[72],"of":[73,78,88,147],"global":[74],"coordination":[75],"or":[76,99,152],"cooperation":[77],"Our":[80],"main":[81],"contribution":[82],"is":[83,111],"show":[85,132,160],"rapid":[86],"convergence":[87,105,134,164],"resulting":[90],"process":[92],"states":[94],"different":[97,150,157],"stability":[98],"balance":[100],"criteria.":[101],"particular,":[103],"time":[106],"Nash":[109,138,169],"equilibrium":[110],"logarithmic":[113],"polynomial":[117,123],",":[120],"where":[121],"depends":[124],"graph":[127],"structure.":[128],"addition,":[130],"we":[131,141],"reduced":[133],"times":[135],"approximate":[137,166],"equilibria.":[139,170],"Finally,":[140],"extend":[142],"our":[143],"results":[144,162],"speeds":[151],"have":[156],"weights":[158],"similar":[161],"exact":[168]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}