{"id":"https://openalex.org/W2497273757","doi":"https://doi.org/10.1109/infocom.2016.7524352","title":"Nash equilibrium and the price of anarchy in priority based network routing","display_name":"Nash equilibrium and the price of anarchy in priority based network routing","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2497273757","doi":"https://doi.org/10.1109/infocom.2016.7524352","mag":"2497273757"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2016.7524352","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524352","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","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/A5021992252","display_name":"Benjamin Grimmer","orcid":"https://orcid.org/0000-0002-7003-8448"},"institutions":[{"id":"https://openalex.org/I180949307","display_name":"Illinois Institute of Technology","ror":"https://ror.org/037t3ry66","country_code":"US","type":"education","lineage":["https://openalex.org/I180949307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Benjamin Grimmer","raw_affiliation_strings":["Department of Computer Science, Illinois Institute of Technology, Chicago, IL"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Illinois Institute of Technology, Chicago, IL","institution_ids":["https://openalex.org/I180949307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062694837","display_name":"Sanjiv Kapoor","orcid":"https://orcid.org/0000-0001-5637-9919"},"institutions":[{"id":"https://openalex.org/I180949307","display_name":"Illinois Institute of Technology","ror":"https://ror.org/037t3ry66","country_code":"US","type":"education","lineage":["https://openalex.org/I180949307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjiv Kapoor","raw_affiliation_strings":["Department of Computer Science, Illinois Institute of Technology, Chicago, IL"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Illinois Institute of Technology, Chicago, IL","institution_ids":["https://openalex.org/I180949307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021992252"],"corresponding_institution_ids":["https://openalex.org/I180949307"],"apc_list":null,"apc_paid":null,"fwci":1.0772,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.8162472,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"57","issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9995999932289124,"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.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9901999831199646,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.984499990940094,"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/price-of-anarchy","display_name":"Price of anarchy","score":0.7862691879272461},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.7311903238296509},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6928995847702026},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4973790943622589},{"id":"https://openalex.org/keywords/inefficiency","display_name":"Inefficiency","score":0.49369868636131287},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4924703538417816},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4455290734767914},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.42967966198921204},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3893739581108093},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3213699460029602},{"id":"https://openalex.org/keywords/price-of-stability","display_name":"Price of stability","score":0.24553009867668152},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19760453701019287},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.16682156920433044},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.08232319355010986}],"concepts":[{"id":"https://openalex.org/C82149807","wikidata":"https://www.wikidata.org/wiki/Q7242623","display_name":"Price of anarchy","level":4,"score":0.7862691879272461},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.7311903238296509},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6928995847702026},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4973790943622589},{"id":"https://openalex.org/C2778869765","wikidata":"https://www.wikidata.org/wiki/Q6028363","display_name":"Inefficiency","level":2,"score":0.49369868636131287},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4924703538417816},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4455290734767914},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.42967966198921204},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3893739581108093},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3213699460029602},{"id":"https://openalex.org/C188466206","wikidata":"https://www.wikidata.org/wiki/Q7242626","display_name":"Price of stability","level":3,"score":0.24553009867668152},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19760453701019287},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.16682156920433044},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.08232319355010986},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C556758197","wikidata":"https://www.wikidata.org/wiki/Q580018","display_name":"Monetary economics","level":1,"score":0.0},{"id":"https://openalex.org/C126285488","wikidata":"https://www.wikidata.org/wiki/Q178476","display_name":"Monetary policy","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2016.7524352","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524352","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1526250527","https://openalex.org/W1659045357","https://openalex.org/W1938417473","https://openalex.org/W2019300822","https://openalex.org/W2023946326","https://openalex.org/W2044667552","https://openalex.org/W2050797500","https://openalex.org/W2053388353","https://openalex.org/W2097568888","https://openalex.org/W2103024660","https://openalex.org/W2106800330","https://openalex.org/W2112269231","https://openalex.org/W2120248764","https://openalex.org/W2145297839","https://openalex.org/W2149248364","https://openalex.org/W2155094695","https://openalex.org/W2156816884","https://openalex.org/W2176566884","https://openalex.org/W2199385070","https://openalex.org/W2216069195","https://openalex.org/W2508573783","https://openalex.org/W3122760300","https://openalex.org/W6636926888"],"related_works":["https://openalex.org/W2108516916","https://openalex.org/W2061191605","https://openalex.org/W2951123922","https://openalex.org/W2089041911","https://openalex.org/W2124332176","https://openalex.org/W2052463720","https://openalex.org/W1972926214","https://openalex.org/W2486809103","https://openalex.org/W2146273102","https://openalex.org/W1966704886"],"abstract_inverted_index":{"We":[0,20,72,152,183],"consider":[1,67,73,104,153],"distributed":[2],"network":[3,33,94],"routing":[4,65,107,113,126],"for":[5,29,63],"networks":[6,75],"that":[7],"support":[8],"differentiated":[9],"services,":[10],"where":[11,92],"services":[12],"are":[13],"prioritized":[14],"by":[15],"a":[16,37,45,77,96,122,130,150],"proportional":[17],"weighting":[18],"system.":[19],"use":[21],"the":[22,55,93,143,154,160,193],"classical":[23],"Generalized":[24],"Processor":[25],"Sharing":[26],"(GPS)":[27],"scheme":[28,59],"scheduling":[30,68],"traffic":[31,42,116,128],"on":[32,50,70,188],"links.":[34],"In":[35,98,174],"such":[36],"scheme,":[38],"each":[39,99,136],"type":[40,119,137],"of":[41,57,79,100,117,138,145,156,162,167,195],"is":[43,95,181],"guaranteed":[44],"minimum":[46],"capacity":[47],"rate":[48],"based":[49],"its":[51],"priority.":[52],"To":[53],"model":[54],"performance":[56],"this":[58,176],"and":[60,88,110,164,192],"to":[61,85,120],"account":[62],"autonomous":[64],"we":[66,103,140],"games":[69],"networks.":[71],"both":[74],"with":[76],"set":[78],"parallel":[80],"links":[81],"(which":[82],"also":[83,184],"applies":[84],"processor":[86],"scheduling)":[87],"more":[89],"general":[90],"scenarios":[91],"multi-graph.":[97],"these":[101,198],"settings":[102],"two":[105],"different":[106],"schemes:":[108],"Atomic":[109,112],"Non-Atomic.":[111],"requires":[114],"all":[115],"one":[118],"follow":[121],"single":[123],"path.":[124],"Non-Atomic":[125],"splits":[127],"into":[129],"flow":[131],"over":[132],"multiple":[133],"paths.":[134],"For":[135],"game,":[139],"prove":[141],"either":[142],"existence":[144,194],"Nash":[146],"Equilibrium":[147],"or":[148],"give":[149],"counterexample.":[151],"inefficiency":[155,177],"equilibrium":[157,196],"(termed":[158],"as":[159],"price":[161,166],"anarchy)":[163],"provide":[165,185],"anarchy":[168],"upper":[169],"bounds":[170],"under":[171],"reasonable":[172],"assumptions.":[173],"general,":[175],"in":[178,197],"queuing":[179],"systems":[180],"unbounded.":[182],"complexity":[186],"results":[187],"computing":[189],"optimal":[190],"solutions":[191],"games.":[199]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}