{"id":"https://openalex.org/W2736204762","doi":null,"title":"The complexity of Nash Equilibria, Local Optima, and Pareto-Optimal solutions","display_name":"The complexity of Nash Equilibria, Local Optima, and Pareto-Optimal solutions","alternate_titles":[],"publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2736204762","mag":"2736204762"},"language":"en","primary_location":{"id":"pmh:oai:publications.rwth-aachen.de:50046","doi":null,"is_oa":true,"landing_page_url":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-112610%22","pdf_url":"http://publications.rwth-aachen.de/record/50046","source":{"id":"https://openalex.org/S4306401033","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Aachen : Publikationsserver der RWTH Aachen University 160 S. : graph. Darst. (2008). = Aachen, Techn. Hochsch., Diss., 2008","raw_type":"info:eu-repo/semantics/doctoralThesis"},"parent_works":[],"lineage":["https://openalex.org/W2736204762"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://publications.rwth-aachen.de/record/50046","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034122679","display_name":"Heiko R\u00f6glin","orcid":"https://orcid.org/0009-0006-8438-3986","observed_orcids":["https://orcid.org/0009-0006-8438-3986"]},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Heiko R\u00f6glin","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Mathematik, Informatik und Naturwissenschaften, Rheinisch-Westf\u00e4lischen Technischen Hochschule Aachen"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik, Informatik und Naturwissenschaften, Rheinisch-Westf\u00e4lischen Technischen Hochschule Aachen","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066021048","display_name":"Berthold V\u00f6cking","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Berthold V\u00f6cking","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":8,"reviewed_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.6215999722480774,"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.6215999722480774,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.20520000159740448,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.1266999989748001,"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.8420000076293945},{"id":"https://openalex.org/keywords/local-optima","display_name":"local optima","score":0.9380000233650208},{"id":"https://openalex.org/keywords/pareto-optimal-solutions","display_name":"Pareto optimal solutions","score":0.972000002861023},{"id":"https://openalex.org/keywords/congestion-games","display_name":"congestion games","score":0.6629999876022339},{"id":"https://openalex.org/keywords/two-sided-markets","display_name":"two-sided markets","score":0.8989999890327454},{"id":"https://openalex.org/keywords/pls-completeness","display_name":"PLS-completeness","score":0.8159999847412109},{"id":"https://openalex.org/keywords/bi-objective-optimization","display_name":"bi-objective optimization","score":0.7739999890327454},{"id":"https://openalex.org/keywords/pareto-front","display_name":"Pareto front","score":0.3149999976158142},{"id":"https://openalex.org/keywords/pareto-front-approximation","display_name":"Pareto front approximation","score":0.36500000953674316}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.6627466082572937},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.6164594888687134},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5163280367851257},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.4757551848888397},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.46005767583847046},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.41482916474342346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38054198026657104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33050858974456787},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.29488319158554077}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:publications.rwth-aachen.de:50046","doi":null,"is_oa":true,"landing_page_url":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-112610%22","pdf_url":"http://publications.rwth-aachen.de/record/50046","source":{"id":"https://openalex.org/S4306401033","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Aachen : Publikationsserver der RWTH Aachen University 160 S. : graph. Darst. (2008). = Aachen, Techn. Hochsch., Diss., 2008","raw_type":"info:eu-repo/semantics/doctoralThesis"},{"id":"mag:2736204762","doi":null,"is_oa":false,"landing_page_url":"https://www.roeglin.org/publications/Dissertation_Heiko.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.218.4062","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.4062","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-i1.informatik.rwth-aachen.de/~roeglin/publications/Dissertation_Heiko.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:publications.rwth-aachen.de:50046","doi":null,"is_oa":true,"landing_page_url":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-112610%22","pdf_url":"http://publications.rwth-aachen.de/record/50046","source":{"id":"https://openalex.org/S4306401033","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Aachen : Publikationsserver der RWTH Aachen University 160 S. : graph. Darst. (2008). = Aachen, Techn. Hochsch., Diss., 2008","raw_type":"info:eu-repo/semantics/doctoralThesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320324232","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2736204762.pdf","grobid_xml":"https://content.openalex.org/works/W2736204762.grobid-xml"},"referenced_works_count":95,"referenced_works":["https://openalex.org/W119169328","https://openalex.org/W187767610","https://openalex.org/W401615553","https://openalex.org/W1480100487","https://openalex.org/W1480622933","https://openalex.org/W1497676467","https://openalex.org/W1513275674","https://openalex.org/W1519748196","https://openalex.org/W1552810675","https://openalex.org/W1581152859","https://openalex.org/W1587360560","https://openalex.org/W1599622173","https://openalex.org/W1604261605","https://openalex.org/W1605128581","https://openalex.org/W1666031364","https://openalex.org/W1799626923","https://openalex.org/W1863921575","https://openalex.org/W1928375144","https://openalex.org/W1928381443","https://openalex.org/W1964011541","https://openalex.org/W1965978641","https://openalex.org/W1978696336","https://openalex.org/W1981110529","https://openalex.org/W1981234161","https://openalex.org/W1994248285","https://openalex.org/W1996167821","https://openalex.org/W1997988698","https://openalex.org/W1998132337","https://openalex.org/W1998739300","https://openalex.org/W2007458506","https://openalex.org/W2019110169","https://openalex.org/W2021677593","https://openalex.org/W2022179164","https://openalex.org/W2024552920","https://openalex.org/W2026427926","https://openalex.org/W2034053794","https://openalex.org/W2038022125","https://openalex.org/W2042986967","https://openalex.org/W2045173407","https://openalex.org/W2047820376","https://openalex.org/W2050761777","https://openalex.org/W2054129049","https://openalex.org/W2055569927","https://openalex.org/W2062417951","https://openalex.org/W2062459871","https://openalex.org/W2063245286","https://openalex.org/W2068115726","https://openalex.org/W2079828065","https://openalex.org/W2079868147","https://openalex.org/W2091887239","https://openalex.org/W2095008598","https://openalex.org/W2099466544","https://openalex.org/W2102736491","https://openalex.org/W2103981148","https://openalex.org/W2106371135","https://openalex.org/W2106378689","https://openalex.org/W2114681551","https://openalex.org/W2119851068","https://openalex.org/W2121956325","https://openalex.org/W2131988597","https://openalex.org/W2143529993","https://openalex.org/W2145297839","https://openalex.org/W2147515492","https://openalex.org/W2152226783","https://openalex.org/W2156613140","https://openalex.org/W2158486621","https://openalex.org/W2161455936","https://openalex.org/W2163428398","https://openalex.org/W2164845984","https://openalex.org/W2165142526","https://openalex.org/W2167101557","https://openalex.org/W2168727889","https://openalex.org/W2170959740","https://openalex.org/W2171306573","https://openalex.org/W2176709158","https://openalex.org/W2330024298","https://openalex.org/W2562560674","https://openalex.org/W2587926013","https://openalex.org/W2610216665","https://openalex.org/W2610479830","https://openalex.org/W2611804663","https://openalex.org/W2615258659","https://openalex.org/W2742600475","https://openalex.org/W2751862591","https://openalex.org/W2899702797","https://openalex.org/W2956015669","https://openalex.org/W2988480584","https://openalex.org/W3022308742","https://openalex.org/W3027820740","https://openalex.org/W3029201735","https://openalex.org/W4242255739","https://openalex.org/W4246092883","https://openalex.org/W4292542951","https://openalex.org/W4300550233","https://openalex.org/W6994761441"],"related_works":["https://openalex.org/W1896373604","https://openalex.org/W2188201681","https://openalex.org/W2167842672","https://openalex.org/W1870956571","https://openalex.org/W4382864594","https://openalex.org/W1697862064","https://openalex.org/W7099337864","https://openalex.org/W2145297839","https://openalex.org/W157305692","https://openalex.org/W2247582943"],"abstract_inverted_index":{"An":[0],"instance":[1,471],"of":[2,22,76,105,120,129,148,191,213,226,260,319,335,369,399,447,453,460,490,518,536,593,636,648,671,680,720],"a":[3,20,62,103,149,154,193,200,220,250,301,316,458,527,547,579,587,634],"combinatorial":[4,88],"optimization":[5,89,340,379,497,598],"problem":[6],"is":[7,15,43,50,146,153,276,372,402,457,473,566,689],"usually":[8],"described":[9],"by":[10,72,136,278,314],"an":[11,293,373,413,467,470,481,645,700],"objective":[12,47],"function":[13],"that":[14,27,83,147,203,263,274,323,346,352,472,529,676,714],"to":[16,102,126,206,253,291,384,532,623,652,710],"be":[17,85,242,356,559,576],"optimized":[18],"over":[19],"set":[21,368,517,535,557],"feasible":[23],"solutions.":[24],"The":[25,139,418],"decisions":[26,69,82,132],"economic":[28],"entities":[29],"face":[30],"every":[31,632],"day":[32],"are":[33,70,91,117,133,347,363,428,436,510],"more":[34,44],"complex":[35],"for":[36,178,210,223,230,377,393,405,493,514,539,551,554,595,602,631],"various":[37,596],"reasons:":[38],"In":[39,235,331,600,650,696],"many":[40,246,289],"situations,":[41],"there":[42,509],"than":[45,59],"one":[46,49,362],"and":[48,80,113,171,197,232,328,366,422,462,626,660,686],"rather":[51],"interested":[52],"in":[53,60,143,156,286,300,349,391,434,450,465,522,542,561,590,663,668],"finding":[54],"the":[55,118,127,189,224,258,261,306,332,350,360,367,397,445,451,487,504,516,534,591,603,654,661,669,677,704,718,721],"most":[56,394],"appropriate":[57],"trade-off":[58],"optimizing":[61],"single":[63],"criterion.":[64],"Further":[65],"complications":[66],"arise":[67],"when":[68,266],"made":[71,135],"selfish":[73,137,182,312],"agents":[74,284,313],"instead":[75],"being":[77],"centrally":[78],"coordinated,":[79],"even":[81],"can":[84,160,241,355,558,575,643],"modeled":[86],"as":[87,381,431,503,578],"problems":[90,341,380,396,501,553],"often":[92,134,437],"intractable":[93],"under":[94],"standard":[95],"complexity-theoretic":[96],"assumptions.":[97],"These":[98],"difficulties":[99],"gave":[100],"rise":[101],"variety":[104],"solution":[106,141,375],"concepts,":[107],"including":[108],"Pareto-optimal":[109,370,400,448,491,519,537],"solutions,":[110],"Nash":[111,150,195,239,573],"equilibria,":[112],"local":[114,580,608,681],"optima,":[115],"which":[116,152,157,282,456,466,555,641],"topic":[119],"this":[121,336,556,657],"thesis.":[122],"When":[123],"it":[124,382,584],"comes":[125],"allocation":[128,180,310],"scarce":[130],"resources,":[131],"agents.":[138,183,255],"predominant":[140],"concept":[142,376],"such":[144,502],"situations":[145],"equilibrium,":[151,196],"state":[155],"no":[158,353,511],"agent":[159],"benefit":[161],"from":[162,440],"unilaterally":[163],"changing":[164],"her":[165],"strategy.":[166],"We":[167,272,304,443,479,525,629,674],"consider":[168,339],"congestion":[169,185,214,228,326],"games":[170,229,322,327],"two-sided":[172,236,329],"markets,":[173,237],"two":[174,343],"extensively":[175],"studied":[176],"models":[177],"resource":[179,309,320],"among":[181,311],"For":[184,499],"games,":[186],"we":[187,198,338,665,698],"analyze":[188,666],"complexity":[190],"computing":[192,571],"pure":[194,238,572],"present":[199,526],"new":[201],"approach":[202,217],"enables":[204],"us":[205,531],"prove":[207,480,699],"PLS-hardness":[208],"results":[209,427,616,694],"different":[211,439],"classes":[212],"games.":[215],"Our":[216],"also":[218,585],"yields":[219],"short":[221],"proof":[222],"PLS-completeness":[225],"network":[227],"directed":[231],"undirected":[233],"networks.":[234],"equilibria":[240,574],"computed":[243],"efficiently,":[244],"but":[245,583],"real-life":[247],"markets":[248],"lack":[249],"central":[251],"authority":[252],"match":[254],"This":[256],"motivates":[257],"study":[259,444],"processes":[262],"take":[264,644],"place":[265],"players":[267],"consecutively":[268],"improve":[269,297],"their":[270,298],"strategies.":[271],"demonstrate":[273],"coordination":[275],"necessary":[277],"constructing":[279],"examples":[280],"on":[281,486,617,640,683,703,717],"uncoordinated":[283],"need":[285],"expectation":[287],"exponentially":[288,414],"steps":[290],"reach":[292],"equilibrium":[294],"if":[295],"they":[296],"strategies":[299],"random":[302,722],"order.":[303],"conclude":[305],"part":[307,334],"about":[308],"introducing":[315],"natural":[317],"class":[318],"sharing":[321],"both":[324,620],"extends":[325],"markets.":[330],"second":[333],"dissertation,":[337],"with":[342,412,546,621,708],"criteria.":[344],"Solutions":[345],"optimal":[348],"sense":[351],"criterion":[354],"improved":[357],"without":[358],"deteriorating":[359],"other":[361],"called":[364],"Pareto-optimal,":[365],"solutions":[371,401,449,492,520,538],"important":[374,569],"bicriteria":[378,395,408,495,505],"helps":[383],"filter":[385],"out":[386],"unreasonable":[387],"trade-offs.":[388],"Even":[389],"though":[390],"practice":[392,423,435],"number":[398,446,489,647,679],"typically":[403],"small,":[404],"almost":[406,482],"all":[407,552,711],"problems,":[409],"instances":[410,619,639,688],"exist":[411],"large":[415],"Pareto":[416],"set.":[417],"discrepancy":[419,655],"between":[420,656],"theory":[421],"arises":[424],"because":[425,570],"worst-case":[426,441,461,658],"overly":[429],"pessimistic":[430],"inputs":[432,541],"occurring":[433],"very":[438],"instances.":[442],"framework":[452,670],"smoothed":[454,672],"analysis,":[455,464],"hybrid":[459],"average-case":[463,693],"adversary":[468],"specifies":[469],"subsequently":[474],"slightly":[475],"perturbed":[476],"at":[477],"random.":[478],"tight":[483],"polynomial":[484,544],"bound":[485,702],"expected":[488,543,678,705],"general":[494],"integer":[496],"problems.":[498,599],"certain":[500],"spanning":[506],"tree":[507],"problem,":[508,582,607],"algorithms":[512],"known":[513],"enumerating":[515],"efficiently":[521],"its":[523],"size.":[524],"method":[528],"allows":[530],"enumerate":[533],"semi-random":[540,684],"time":[545,625],"small":[548],"failure":[549],"probability":[550],"enumerated":[560],"pseudopolynomial":[562],"time.":[563],"Local":[564],"search":[565,581,609],"not":[567],"only":[568],"phrased":[577],"plays":[586],"crucial":[588],"role":[589],"design":[592],"heuristics":[594,610],"NP-hard":[597],"particular,":[601],"famous":[604],"traveling":[605],"salesperson":[606],"like":[611],"2-Opt":[612,642,667],"achieve":[613],"amazingly":[614],"good":[615],"real-world":[618],"respect":[622,709],"running":[624],"approximation":[627,706],"ratio.":[628],"present,":[630],"p,":[633],"family":[635],"two-dimensional":[637],"Lp":[638,712],"exponential":[646],"steps.":[649],"order":[651],"explain":[653],"result":[659],"observations":[662],"practice,":[664],"analysis.":[673],"show":[675],"improvements":[682],"Manhattan":[685],"Euclidean":[687],"polynomial,":[690],"improving":[691],"previous":[692],"significantly.":[695],"addition,":[697],"upper":[701],"factor":[707],"metrics":[713],"depends":[715],"polynomially":[716],"magnitude":[719],"perturbation.":[723]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2736204762","counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2017-07-21T00:00:00"}
