{"id":"https://openalex.org/W3048709314","doi":"https://doi.org/10.1007/s10107-020-01546-6","title":"Computation and efficiency of potential function minimizers of combinatorial congestion games","display_name":"Computation and efficiency of potential function minimizers of combinatorial congestion games","publication_year":2020,"publication_date":"2020-08-11","ids":{"openalex":"https://openalex.org/W3048709314","doi":"https://doi.org/10.1007/s10107-020-01546-6","mag":"3048709314"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-020-01546-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-020-01546-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01546-6.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01546-6.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028176057","display_name":"Pieter Kleer","orcid":"https://orcid.org/0000-0003-4304-7282"},"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"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Pieter Kleer","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarland Informatics Campus (SIC), Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarland Informatics Campus (SIC), Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067080233","display_name":"Guido Sch\u00e4fer","orcid":"https://orcid.org/0000-0002-1923-4902"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Guido Sch\u00e4fer","raw_affiliation_strings":["Department of Econometrics and Operations Research, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","Networks and Optimization Group, Centrum Wiskunde & Informatica, Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Econometrics and Operations Research, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]},{"raw_affiliation_string":"Networks and Optimization Group, Centrum Wiskunde & Informatica, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028176057"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":0.7437,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.75531246,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"190","issue":"1-2","first_page":"523","last_page":"560"},"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T10646","display_name":"Experimental Behavioral Economics Studies","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/3311","display_name":"Safety Research"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5448623895645142},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5166433453559875},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44042977690696716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3851917088031769}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5448623895645142},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5166433453559875},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44042977690696716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3851917088031769},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"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":6,"locations":[{"id":"doi:10.1007/s10107-020-01546-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-020-01546-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01546-6.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/01571468-ef7d-490e-9fa8-012d58519133","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/computation-and-efficiency-of-potential-function-minimizers-of-combinatorial-congestion-games(01571468-ef7d-490e-9fa8-012d58519133).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kleer, P & Sch\u00e4fer, G 2021, 'Computation and efficiency of potential function minimizers of combinatorial congestion games', Mathematical programming, vol. 190, no. 1-2, pp. 523-560. https://doi.org/10.1007/s10107-020-01546-6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:research.vu.nl:openaire/bef4112a-f142-4c1a-a8ed-99cddfe88ad2","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/bef4112a-f142-4c1a-a8ed-99cddfe88ad2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"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":"Kleer, P & Sch\u00e4fer, G 2021, 'Computation and efficiency of potential function minimizers of combinatorial congestion games', Mathematical Programming, vol. 190, no. 1-2, pp. 523-560. https://doi.org/10.1007/s10107-020-01546-6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:tilburguniversity.edu:openaire/735a1e0c-6d97-4bfa-95d7-12e4b058e981","is_oa":true,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/735a1e0c-6d97-4bfa-95d7-12e4b058e981","pdf_url":null,"source":{"id":"https://openalex.org/S4406923027","display_name":"Tilburg University Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Kleer, P & Sch\u00e4fer, G 2021, 'Computation and efficiency of potential function minimizers of combinatorial congestion games', Mathematical Programming, vol. 190, pp. 523-560. https://doi.org/10.1007/s10107-020-01546-6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:cwi:oai:cwi.nl:30170","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/30170","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Programming, 190, 523 - 560","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.mpg.de:item_3250902","is_oa":true,"landing_page_url":"http://hdl.handle.net/21.11116/0000-0006-F285-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Programming","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s10107-020-01546-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-020-01546-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01546-6.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7830895999","display_name":null,"funder_award_id":"024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3048709314.pdf","grobid_xml":"https://content.openalex.org/works/W3048709314.grobid-xml"},"referenced_works_count":53,"referenced_works":["https://openalex.org/W49239469","https://openalex.org/W1526250527","https://openalex.org/W1604158939","https://openalex.org/W1620026671","https://openalex.org/W1758887450","https://openalex.org/W1963547452","https://openalex.org/W1972577005","https://openalex.org/W1978317291","https://openalex.org/W1996249306","https://openalex.org/W1997075516","https://openalex.org/W1999497750","https://openalex.org/W2007126746","https://openalex.org/W2011144523","https://openalex.org/W2012287357","https://openalex.org/W2016663842","https://openalex.org/W2017227260","https://openalex.org/W2021677593","https://openalex.org/W2041462779","https://openalex.org/W2053352956","https://openalex.org/W2054129049","https://openalex.org/W2054873505","https://openalex.org/W2065925866","https://openalex.org/W2072951587","https://openalex.org/W2075004702","https://openalex.org/W2076263225","https://openalex.org/W2090960684","https://openalex.org/W2095094403","https://openalex.org/W2100440346","https://openalex.org/W2106800330","https://openalex.org/W2107547393","https://openalex.org/W2124888702","https://openalex.org/W2127470768","https://openalex.org/W2145297839","https://openalex.org/W2156347727","https://openalex.org/W2156613140","https://openalex.org/W2170569385","https://openalex.org/W2171358488","https://openalex.org/W2199385070","https://openalex.org/W2213181670","https://openalex.org/W2216069195","https://openalex.org/W2270201883","https://openalex.org/W2294025081","https://openalex.org/W2508573783","https://openalex.org/W2577600314","https://openalex.org/W2759949687","https://openalex.org/W2794731633","https://openalex.org/W2963252897","https://openalex.org/W3000411098","https://openalex.org/W3022321359","https://openalex.org/W3044238769","https://openalex.org/W3121308144","https://openalex.org/W4247278211","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644"],"abstract_inverted_index":{"Abstract":[0],"We":[1,185,206],"study":[2],"the":[3,16,25,83,120,128,187,201,217],"computation":[4],"and":[5,127,145,192,231,248,258],"efficiency":[6],"of":[7,18,28,49,82,181,189,203,220,225],"pure":[8,65,154],"Nash":[9,66,155],"equilibria":[10,67,156,191,215],"in":[11,160],"combinatorial":[12],"congestion":[13,52,141,222,227,237,242,246,252],"games,":[14,238,243],"where":[15],"strategies":[17],"each":[19],"player":[20],"i":[21],"are":[22,111,147],"given":[23],"by":[24],"binary":[26],"vectors":[27],"a":[29,170,197],"polytope":[30,86],"$$P_i$$":[31],"<mml:math":[32,92],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[33,93],"<mml:msub>":[34,95,100,104],"<mml:mi>P</mml:mi>":[35,96,105],"<mml:mi>i</mml:mi>":[36,102,106],"</mml:msub>":[37,98,103,107],"</mml:math>":[38,109],".":[39],"Our":[40,136],"main":[41,137],"goal":[42],"is":[43],"to":[44,56,63,116,213],"understand":[45],"which":[46,110,178],"structural":[47],"properties":[48,81],"such":[50],"polytopal":[51,140,221,226],"games":[53,142,228,247,253],"enable":[54],"us":[55],"derive":[57],"an":[58],"efficient":[59],"equilibrium":[60],"selection":[61],"procedure":[62],"compute":[64],"with":[68],"attractive":[69],"social":[70],"cost":[71],"approximation":[72],"guarantees.":[73],"To":[74],"this":[75,167,195],"aim,":[76],"we":[77,151,165],"identify":[78],"two":[79],"general":[80,171],"underlying":[84],"aggregation":[85],"$$P_N":[87],"=":[88],"\\sum":[89],"_i":[90],"P_i$$":[91],"<mml:mrow>":[94],"<mml:mi>N</mml:mi>":[97],"<mml:mo>=</mml:mo>":[99],"<mml:mo>\u2211</mml:mo>":[101],"</mml:mrow>":[108],"sufficient":[112],"for":[113,139,173,216],"our":[114],"results":[115,138,211],"go":[117],"through,":[118],"namely":[119],"integer":[121],"decomposition":[122],"property":[123,132],"(":[124,133],"IDP":[125,144,230],")":[126],"box-totally":[129],"dual":[130],"integrality":[131],"box-TDI":[134,146,232],").":[135],"satisfying":[143,229],"as":[148],"follows:":[149],"(i)":[150],"show":[152,193],"that":[153,194,209],"can":[157],"be":[158,180],"computed":[159],"polynomial":[161],"time.":[162],"In":[163],"fact,":[164],"obtain":[166],"result":[168],"through":[169],"framework":[172],"separable":[174],"convex":[175],"function":[176],"minimization,":[177],"might":[179],"independent":[182],"interest.":[183],"(ii)":[184],"bound":[186,199],"inefficiency":[188],"these":[190,210],"provides":[196],"tight":[198],"on":[200],"price":[202],"stability.":[204],"(iii)":[205],"also":[207],"prove":[208],"extend":[212],"strong":[214],"\u201cbottleneck":[218],"variant\u201d":[219],"games.":[223],"Examples":[224],"include":[233],"common":[234],"source":[235],"network":[236],"symmetric":[239,249],"totally":[240],"unimodular":[241],"non-symmetric":[244],"matroid":[245,250],"intersection":[251],"(in":[254],"particular,":[255],"r":[256],"-arborescences":[257],"strongly":[259],"base-orderable":[260],"matroids).":[261]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2}],"updated_date":"2026-05-31T08:46:17.908082","created_date":"2025-10-10T00:00:00"}