{"id":"https://openalex.org/W1978123437","doi":"https://doi.org/10.1109/tnet.2013.2247416","title":"A Game-Theoretic Approach to Stable Routing in Max-Min Fair Networks","display_name":"A Game-Theoretic Approach to Stable Routing in Max-Min Fair Networks","publication_year":2013,"publication_date":"2013-04-03","ids":{"openalex":"https://openalex.org/W1978123437","doi":"https://doi.org/10.1109/tnet.2013.2247416","mag":"1978123437"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2013.2247416","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2013.2247416","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"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/ACM Transactions on Networking","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/A5048130147","display_name":"Dejun Yang","orcid":"https://orcid.org/0000-0002-1811-4423"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dejun Yang","raw_affiliation_strings":["CIDSE Dept., Arizona State University, Tempe, AZ","Sch. of Comput., Inf., & Decision Syst. Eng., Arizona State Univ., Tempe, AZ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CIDSE Dept., Arizona State University, Tempe, AZ","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Sch. of Comput., Inf., & Decision Syst. Eng., Arizona State Univ., Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026230689","display_name":"Guoliang Xue","orcid":"https://orcid.org/0000-0002-5833-8894"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guoliang Xue","raw_affiliation_strings":["CIDSE Dept., Arizona State University, Tempe, AZ","Sch. of Comput., Inf., & Decision Syst. Eng., Arizona State Univ., Tempe, AZ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CIDSE Dept., Arizona State University, Tempe, AZ","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Sch. of Comput., Inf., & Decision Syst. Eng., Arizona State Univ., Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010754242","display_name":"Xi Fang","orcid":"https://orcid.org/0000-0002-3783-2041"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xi Fang","raw_affiliation_strings":["CIDSE Dept., Arizona State University, Tempe, AZ","Sch. of Comput., Inf., & Decision Syst. Eng., Arizona State Univ., Tempe, AZ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CIDSE Dept., Arizona State University, Tempe, AZ","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Sch. of Comput., Inf., & Decision Syst. Eng., Arizona State Univ., Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029387062","display_name":"Satyajayant Misra","orcid":"https://orcid.org/0000-0001-7347-984X"},"institutions":[{"id":"https://openalex.org/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Satyajayant Misra","raw_affiliation_strings":["CS Dept., New Mexico State University, Las Cruces, NM","Computer Science Department, New Mexico State University Las Cruces, NM, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CS Dept., New Mexico State University, Las Cruces, NM","institution_ids":["https://openalex.org/I10052268"]},{"raw_affiliation_string":"Computer Science Department, New Mexico State University Las Cruces, NM, USA","institution_ids":["https://openalex.org/I10052268"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100405936","display_name":"Jin Zhang","orcid":"https://orcid.org/0000-0002-0946-5520"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jin Zhang","raw_affiliation_strings":["CIDSE Dept., Arizona State University, Tempe, AZ","Google, Inc., Kirkland, WA and School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, AZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CIDSE Dept., Arizona State University, Tempe, AZ","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Google, Inc., Kirkland, WA and School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, AZ","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6734,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.8512233,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"21","issue":"6","first_page":"1947","last_page":"1959"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.998199999332428,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9973999857902527,"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.9944000244140625,"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.7684085369110107},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7652734518051147},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.5472686886787415},{"id":"https://openalex.org/keywords/network-congestion","display_name":"Network congestion","score":0.5449314713478088},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4983062744140625},{"id":"https://openalex.org/keywords/potential-game","display_name":"Potential game","score":0.4826532006263733},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.47850194573402405},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4524863064289093},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.44576019048690796},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4353156089782715},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.4182603657245636},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.4168599545955658},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16847959160804749},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.15554296970367432},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.07294732332229614}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.7684085369110107},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7652734518051147},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.5472686886787415},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.5449314713478088},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4983062744140625},{"id":"https://openalex.org/C2778079155","wikidata":"https://www.wikidata.org/wiki/Q288500","display_name":"Potential game","level":3,"score":0.4826532006263733},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.47850194573402405},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4524863064289093},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.44576019048690796},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4353156089782715},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.4182603657245636},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.4168599545955658},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16847959160804749},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.15554296970367432},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.07294732332229614}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tnet.2013.2247416","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2013.2247416","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"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/ACM Transactions on Networking","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.387.2706","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.2706","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.public.asu.edu/~dyang16/doc/TON2013-Routing.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1526250527","https://openalex.org/W1611178753","https://openalex.org/W1987300875","https://openalex.org/W2026402358","https://openalex.org/W2073440460","https://openalex.org/W2084224084","https://openalex.org/W2100415265","https://openalex.org/W2105808107","https://openalex.org/W2107983838","https://openalex.org/W2111889949","https://openalex.org/W2123376500","https://openalex.org/W2123878303","https://openalex.org/W2125258707","https://openalex.org/W2130556831","https://openalex.org/W2139046551","https://openalex.org/W2140790422","https://openalex.org/W2142065670","https://openalex.org/W2152119126","https://openalex.org/W2157289131","https://openalex.org/W2169528473","https://openalex.org/W2296256089","https://openalex.org/W2613173048","https://openalex.org/W3161194055","https://openalex.org/W3163287424","https://openalex.org/W4230500858","https://openalex.org/W4239980295","https://openalex.org/W6631508959"],"related_works":["https://openalex.org/W4300514062","https://openalex.org/W2949715110","https://openalex.org/W2787689390","https://openalex.org/W4298859366","https://openalex.org/W2949401733","https://openalex.org/W2037991888","https://openalex.org/W1102099748","https://openalex.org/W2093123841","https://openalex.org/W3125511878","https://openalex.org/W4210759752"],"abstract_inverted_index":{"In":[0,78],"this":[1],"paper,":[2],"we":[3,80],"present":[4,139],"a":[5,29,60,75,96,101,113,117,140],"game-theoretic":[6],"study":[7],"of":[8,11,52,86,92,104,132],"the":[9,21,50,83,90,93,152,156,166],"problem":[10,25],"routing":[12,45,72],"in":[13,32,127],"networks":[14],"with":[15,119],"max-min":[16,123],"fair":[17,124],"congestion":[18,125],"control":[19,126],"at":[20,59],"link":[22],"level.":[23],"The":[24],"is":[26,56],"formulated":[27],"as":[28,95],"noncooperative":[30],"game,":[31],"which":[33],"each":[34,109],"user":[35,65,114],"aims":[36],"to":[37,69,74,115,143,159,169,181],"maximize":[38],"its":[39,44,71],"own":[40],"bandwidth":[41,107,121],"by":[42,150],"selecting":[43],"path.":[46],"We":[47,98,137],"first":[48],"prove":[49,148],"existence":[51],"Nash":[53,61],"equilibria.":[54],"This":[55],"important,":[57],"because":[58],"equilibrium":[62],"(NE),":[63],"no":[64],"has":[66],"any":[67],"incentive":[68],"change":[70],"strategy-leading":[73],"stable":[76],"state.":[77],"addition,":[79],"investigate":[81],"how":[82],"selfish":[84],"behavior":[85],"users":[87,134],"may":[88],"affect":[89],"performance":[91],"network":[94,157],"whole.":[97],"next":[99],"introduce":[100],"novel":[102],"concept":[103],"observed":[105],"available":[106],"on":[108],"link.":[110],"It":[111],"allows":[112],"find":[116],"path":[118],"maximum":[120],"under":[122],"polynomial":[128],"time,":[129],"when":[130],"paths":[131],"other":[133,182],"are":[135],"fixed.":[136],"then":[138],"game-based":[141],"algorithm":[142,167],"compute":[144],"an":[145,160,170],"NE":[146,171],"and":[147,175],"that":[149,165],"following":[151],"natural":[153],"game":[154],"course,":[155],"converges":[158,168],"NE.":[161],"Extensive":[162],"simulations":[163],"show":[164],"within":[172],"10":[173],"iterations":[174],"also":[176],"achieves":[177],"better":[178],"fairness":[179],"compared":[180],"algorithms":[183],".":[184]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}