{"id":"https://openalex.org/W2092758733","doi":"https://doi.org/10.1109/gamenets.2009.5137397","title":"How to find Nash equilibria with extreme total latency in network congestion games?","display_name":"How to find Nash equilibria with extreme total latency in network congestion games?","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2092758733","doi":"https://doi.org/10.1109/gamenets.2009.5137397","mag":"2092758733"},"language":"en","primary_location":{"id":"doi:10.1109/gamenets.2009.5137397","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gamenets.2009.5137397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 International Conference on Game Theory for Networks","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/A5049995986","display_name":"Heike Sperber","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Heike Sperber","raw_affiliation_strings":["Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany","University of Kaiserslautern, Department of Mathematics, Optimization Research Group, P.O.Box 3049, 67653, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"University of Kaiserslautern, Department of Mathematics, Optimization Research Group, P.O.Box 3049, 67653, Germany","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049995986"],"corresponding_institution_ids":["https://openalex.org/I153267046"],"apc_list":null,"apc_paid":null,"fwci":0.8321,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77969939,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"1563","issue":null,"first_page":"158","last_page":"163"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9998999834060669,"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.9998999834060669,"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/T12592","display_name":"Opinion Dynamics and Social Influence","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"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.9890000224113464,"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/nash-equilibrium","display_name":"Nash equilibrium","score":0.840522289276123},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5877102017402649},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5178911685943604},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.49936532974243164},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48402827978134155},{"id":"https://openalex.org/keywords/price-of-anarchy","display_name":"Price of anarchy","score":0.46640744805336},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.43098559975624084},{"id":"https://openalex.org/keywords/epsilon-equilibrium","display_name":"Epsilon-equilibrium","score":0.42962077260017395},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.42850008606910706},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4260680675506592},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4246046543121338},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4206102788448334},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38272368907928467},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36124086380004883},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3428916335105896},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34264951944351196},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22842702269554138},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12003761529922485},{"id":"https://openalex.org/keywords/price-of-stability","display_name":"Price of stability","score":0.11423596739768982}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.840522289276123},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5877102017402649},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5178911685943604},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.49936532974243164},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48402827978134155},{"id":"https://openalex.org/C82149807","wikidata":"https://www.wikidata.org/wiki/Q7242623","display_name":"Price of anarchy","level":4,"score":0.46640744805336},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.43098559975624084},{"id":"https://openalex.org/C141824439","wikidata":"https://www.wikidata.org/wiki/Q307521","display_name":"Epsilon-equilibrium","level":4,"score":0.42962077260017395},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.42850008606910706},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4260680675506592},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4246046543121338},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4206102788448334},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38272368907928467},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36124086380004883},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3428916335105896},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34264951944351196},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22842702269554138},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12003761529922485},{"id":"https://openalex.org/C188466206","wikidata":"https://www.wikidata.org/wiki/Q7242626","display_name":"Price of stability","level":3,"score":0.11423596739768982},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C126285488","wikidata":"https://www.wikidata.org/wiki/Q178476","display_name":"Monetary policy","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/gamenets.2009.5137397","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gamenets.2009.5137397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 International Conference on Game Theory for Networks","raw_type":"proceedings-article"},{"id":"pmh:oai:kluedo.ub.rptu.de:2034","is_oa":false,"landing_page_url":"https://kluedo.ub.rptu.de/frontdoor/index/index/docId/2034","pdf_url":null,"source":{"id":"https://openalex.org/S4306402046","display_name":"Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153267046","host_organization_name":"University of Kaiserslautern","host_organization_lineage":["https://openalex.org/I153267046"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"report"},{"id":"pmh:oai:kluedo.ub.uni-kl.de:2034","is_oa":false,"landing_page_url":"https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2034","pdf_url":null,"source":{"id":"https://openalex.org/S4306402046","display_name":"Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153267046","host_organization_name":"University of Kaiserslautern","host_organization_lineage":["https://openalex.org/I153267046"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1573214621","https://openalex.org/W1579344322","https://openalex.org/W1966132455","https://openalex.org/W1989972248","https://openalex.org/W2011039300","https://openalex.org/W2017227260","https://openalex.org/W2018136046","https://openalex.org/W2021677593","https://openalex.org/W2030914480","https://openalex.org/W2052463720","https://openalex.org/W2054129049","https://openalex.org/W2056606651","https://openalex.org/W2088559962","https://openalex.org/W2097568888","https://openalex.org/W2112269231","https://openalex.org/W2125537511","https://openalex.org/W2145297839","https://openalex.org/W2153541270","https://openalex.org/W4285719527","https://openalex.org/W4297563113","https://openalex.org/W6610072603","https://openalex.org/W6631508959","https://openalex.org/W6641581554","https://openalex.org/W6654494608"],"related_works":["https://openalex.org/W1853631319","https://openalex.org/W2092374696","https://openalex.org/W4315489088","https://openalex.org/W2013767790","https://openalex.org/W2481143976","https://openalex.org/W4301347782","https://openalex.org/W3125812435","https://openalex.org/W1996249306","https://openalex.org/W2109158305","https://openalex.org/W2145335304"],"abstract_inverted_index":{"We":[0,44],"study":[1],"the":[2,21,25,104,108],"complexity":[3],"of":[4,27,110],"finding":[5,68,81,111],"extreme":[6],"pure":[7],"Nash":[8,71,114],"equilibria":[9,35],"in":[10,87,103],"symmetric":[11],"network":[12],"congestion":[13],"games":[14],"and":[15,24,33,93],"analyse":[16],"how":[17],"it":[18],"depends":[19],"on":[20,62,116],"graph":[22],"topology":[23],"number":[26],"users.":[28],"In":[29],"our":[30],"context":[31],"best":[32,83],"worst":[34,70,113],"are":[36],"those":[37],"with":[38,56],"minimum":[39],"respectively":[40],"maximum":[41],"total":[42],"latency.":[43],"establish":[45,101],"that":[46],"both":[47],"problems":[48],"can":[49],"be":[50],"solved":[51],"by":[52],"a":[53,57,69,82,112,117],"Greedy":[54],"algorithm":[55],"suitable":[58],"tie":[59],"breaking":[60],"rule":[61],"parallel":[63],"links.":[64],"On":[65],"series-parallel":[66],"graphs":[67],"equilibrium":[72,115],"is":[73,85],"NP-hard":[74,94],"for":[75,90,95,107],"two":[76,91],"or":[77,97],"more":[78],"users":[79,92],"while":[80],"one":[84],"solvable":[86],"polynomial":[88],"time":[89],"three":[96],"more.":[98],"Additionally":[99],"we":[100],"NP-hardness":[102],"strong":[105],"sense":[106],"problem":[109],"general":[118],"acyclic":[119],"graph.":[120]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}