{"id":"https://openalex.org/W2965546823","doi":"https://doi.org/10.24963/ijcai.2019/69","title":"Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions","display_name":"Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions","publication_year":2019,"publication_date":"2019-07-28","ids":{"openalex":"https://openalex.org/W2965546823","doi":"https://doi.org/10.24963/ijcai.2019/69","mag":"2965546823"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2019/69","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/69","pdf_url":"https://www.ijcai.org/proceedings/2019/0069.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2019/0069.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039843107","display_name":"Alberto Marchesi","orcid":"https://orcid.org/0000-0002-8284-5757"},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alberto Marchesi","raw_affiliation_strings":["Politecnico di Milano, Piazza Leonardo da Vinci 32, Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Politecnico di Milano, Piazza Leonardo da Vinci 32, Milano, Italy","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018390908","display_name":"Matteo Castiglioni","orcid":"https://orcid.org/0000-0002-1070-6766"},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Matteo Castiglioni","raw_affiliation_strings":["Politecnico di Milano, Piazza Leonardo da Vinci 32, Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Politecnico di Milano, Piazza Leonardo da Vinci 32, Milano, Italy","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060367013","display_name":"Nicola Gatti","orcid":"https://orcid.org/0000-0001-7349-3932"},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Nicola Gatti","raw_affiliation_strings":["Politecnico di Milano, Piazza Leonardo da Vinci 32, Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Politecnico di Milano, Piazza Leonardo da Vinci 32, Milano, Italy","institution_ids":["https://openalex.org/I93860229"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I93860229"],"apc_list":null,"apc_paid":null,"fwci":3.6584,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.93854287,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"485","last_page":"491"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9986000061035156,"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.9986000061035156,"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.987500011920929,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9840999841690063,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/stackelberg-competition","display_name":"Stackelberg competition","score":0.7444698810577393},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.6790781021118164},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.6303925514221191},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6117020845413208},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5673329830169678},{"id":"https://openalex.org/keywords/singleton","display_name":"Singleton","score":0.5481394529342651},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5166142582893372},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5018970966339111},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.46896660327911377},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44718092679977417},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.44479674100875854},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.43055906891822815},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.403540700674057},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.36497095227241516},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30785101652145386},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13738486170768738}],"concepts":[{"id":"https://openalex.org/C199510392","wikidata":"https://www.wikidata.org/wiki/Q1184602","display_name":"Stackelberg competition","level":2,"score":0.7444698810577393},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.6790781021118164},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.6303925514221191},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6117020845413208},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5673329830169678},{"id":"https://openalex.org/C117354338","wikidata":"https://www.wikidata.org/wiki/Q1165112","display_name":"Singleton","level":3,"score":0.5481394529342651},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5166142582893372},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5018970966339111},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.46896660327911377},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44718092679977417},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.44479674100875854},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.43055906891822815},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.403540700674057},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.36497095227241516},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30785101652145386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13738486170768738},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2779234561","wikidata":"https://www.wikidata.org/wiki/Q11995","display_name":"Pregnancy","level":2,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.24963/ijcai.2019/69","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/69","pdf_url":"https://www.ijcai.org/proceedings/2019/0069.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},{"id":"pmh:oai:re.public.polimi.it:11311/1146371","is_oa":false,"landing_page_url":"http://hdl.handle.net/11311/1146371","pdf_url":null,"source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2019/69","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2019/69","pdf_url":"https://www.ijcai.org/proceedings/2019/0069.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G15967578","display_name":null,"funder_award_id":"PRIN_2017","funder_id":"https://openalex.org/F4320321873","funder_display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca"}],"funders":[{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2965546823.pdf","grobid_xml":"https://content.openalex.org/works/W2965546823.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W568984285","https://openalex.org/W1620410031","https://openalex.org/W1698757037","https://openalex.org/W1971309210","https://openalex.org/W1978317291","https://openalex.org/W1988622494","https://openalex.org/W2029456721","https://openalex.org/W2054129049","https://openalex.org/W2083663874","https://openalex.org/W2110504778","https://openalex.org/W2112794046","https://openalex.org/W2123036301","https://openalex.org/W2145297839","https://openalex.org/W2145512846","https://openalex.org/W2155867373","https://openalex.org/W2156613140","https://openalex.org/W2166294754","https://openalex.org/W2180727665","https://openalex.org/W2198558401","https://openalex.org/W2200247592","https://openalex.org/W2463795603","https://openalex.org/W2739840601","https://openalex.org/W2753202239","https://openalex.org/W2808595754","https://openalex.org/W2946633660","https://openalex.org/W2947687829","https://openalex.org/W2966541889","https://openalex.org/W2976692023","https://openalex.org/W4288345963","https://openalex.org/W4289709211"],"related_works":["https://openalex.org/W747331120","https://openalex.org/W2351588585","https://openalex.org/W2733656312","https://openalex.org/W2976114880","https://openalex.org/W2328458106","https://openalex.org/W2750377096","https://openalex.org/W2030312085","https://openalex.org/W2221885959","https://openalex.org/W2000611521","https://openalex.org/W2963754540"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,18,25,54,57,80,94,111,125,155,162,179],"problem":[3,26,81,180],"of":[4,14,41,56,73,106,157],"finding":[5],"Stackelberg":[6],"equilibria":[7],"in":[8,23,29,86,93,97,151],"games":[9,67,120],"with":[10,121,184],"a":[11,38,143],"massive":[12],"number":[13,156],"players.":[15],"So":[16],"far,":[17],"only":[19,107,185],"known":[20],"game":[21,210],"instances":[22,45,211,214],"which":[24,98,133],"is":[27,46,82,159],"solved":[28],"polynomial":[30,152],"time":[31],"are":[32,71,100,104,114,127],"some":[33],"particular":[34],"congestion":[35],"games.":[36],"However,":[37],"complete":[39],"characterization":[40],"hard":[42],"and":[43,76,84,110,161,188,201,212],"easy":[44],"still":[47],"lacking.":[48],"In":[49,138],"this":[50,139],"paper,":[51],"we":[52,64,77,117,141,168,172,195,202],"extend":[53],"state":[55],"art":[58],"along":[59],"two":[60,108],"main":[61],"directions.":[62],"First,":[63],"focus":[65,118],"on":[66,119,132,207,216],"where":[68,124],"players'":[69],"actions":[70,103,123,134],"made":[72,105],"multiple":[74],"resources,":[75,109],"prove":[78,169],"that":[79,147],"NP-hard":[83,182],"not":[85],"Poly-APX":[87],"unless":[88],"P":[89],"=":[90],"NP,":[91],"even":[92,183],"basic":[95],"case":[96],"players":[99,126],"symmetric,":[101],"their":[102,205],"cost":[112],"functions":[113],"monotonic.":[115],"Second,":[116],"singleton":[122],"partitioned":[128],"into":[129],"classes,":[130],"depending":[131],"they":[135],"have":[136],"available.":[137],"case,":[140],"provide":[142,196],"dynamic":[144],"programming":[145,199],"algorithm":[146],"finds":[148],"an":[149],"equilibrium":[150],"time,":[153],"when":[154],"classes":[158,187],"fixed":[160],"leader":[163],"plays":[164],"pure":[165],"strategies.":[166],"Moreover,":[167],"that,":[170],"if":[171],"allow":[173],"for":[174,192],"leader's":[175],"mixed":[176],"strategies,":[177],"then":[178],"becomes":[181],"four":[186],"monotonic":[189],"costs.":[190],"Finally,":[191],"both":[193,208],"settings,":[194],"mixed-integer":[197],"linear":[198],"formulations,":[200],"experimentally":[203],"evaluate":[204],"scalability":[206],"random":[209],"worst-case":[213],"based":[215],"our":[217],"hardness":[218],"reductions.":[219]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}