{"id":"https://openalex.org/W3200066679","doi":"https://doi.org/10.1609/aaai.v36i5.20461","title":"Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions","display_name":"Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions","publication_year":2022,"publication_date":"2022-06-28","ids":{"openalex":"https://openalex.org/W3200066679","doi":"https://doi.org/10.1609/aaai.v36i5.20461","mag":"3200066679"},"language":"en","primary_location":{"id":"doi:10.1609/aaai.v36i5.20461","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v36i5.20461","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1609/aaai.v36i5.20461","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029689137","display_name":"Brian Hu Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian Hu Zhang","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023571961","display_name":"T\u00fcomas Sandholm","orcid":"https://orcid.org/0000-0001-8861-9366"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tuomas Sandholm","raw_affiliation_strings":["Carnegie Mellon University\nStrategy Robot, Inc.,\nOptimized Markets, Inc.,\nStrategic Machine, Inc"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University\nStrategy Robot, Inc.,\nOptimized Markets, Inc.,\nStrategic Machine, Inc","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.1676,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.7960502,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"36","issue":"5","first_page":"5252","last_page":"5259"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.995199978351593,"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/T11031","display_name":"Game Theory and Applications","score":0.995199978351593,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5376713275909424},{"id":"https://openalex.org/keywords/game-tree","display_name":"Game tree","score":0.5023376941680908},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48914530873298645},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4750934839248657},{"id":"https://openalex.org/keywords/repeated-game","display_name":"Repeated game","score":0.4380960464477539},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.4207615852355957},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4155645966529846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4139999449253082},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.41308844089508057},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.30499422550201416},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2792617082595825},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2703709006309509},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.218995600938797}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5376713275909424},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.5023376941680908},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48914530873298645},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4750934839248657},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.4380960464477539},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.4207615852355957},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4155645966529846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4139999449253082},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.41308844089508057},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.30499422550201416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2792617082595825},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2703709006309509},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.218995600938797},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1609/aaai.v36i5.20461","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v36i5.20461","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:ojs.aaai.org:article/20461","is_oa":true,"landing_page_url":"https://ojs.aaai.org/index.php/AAAI/article/view/20461","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/20461/20220","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2159-5399","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v36i5.20461","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v36i5.20461","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5}],"awards":[{"id":"https://openalex.org/G5211587205","display_name":"AitF: Algorithms and Mechanisms for Kidney Exchange","funder_award_id":"1733556","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5577197131","display_name":"RI: Medium: Learning to Search: Provable Guarantees and Applications","funder_award_id":"1901403","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5726341513","display_name":"RI: Small: New Computational Techniques and Market Designs for Kidney Exchanges and Other Barter Markets","funder_award_id":"1718457","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6869609206","display_name":null,"funder_award_id":"W911NF2010081","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1531901583","https://openalex.org/W1800198041","https://openalex.org/W1980717955","https://openalex.org/W2006791053","https://openalex.org/W2008519844","https://openalex.org/W2029448190","https://openalex.org/W2040611357","https://openalex.org/W2086386133","https://openalex.org/W2113351146","https://openalex.org/W2120340025","https://openalex.org/W2145147424","https://openalex.org/W2554655264","https://openalex.org/W2765775789","https://openalex.org/W2770255342","https://openalex.org/W2773381986","https://openalex.org/W2891685936","https://openalex.org/W2954849416","https://openalex.org/W2960876848","https://openalex.org/W2963372454","https://openalex.org/W2963862338","https://openalex.org/W3083809045","https://openalex.org/W3088096814","https://openalex.org/W3100617838","https://openalex.org/W3168847021","https://openalex.org/W3215530464","https://openalex.org/W4293052541","https://openalex.org/W6600406583","https://openalex.org/W6652068797","https://openalex.org/W6652543772","https://openalex.org/W6765906020"],"related_works":["https://openalex.org/W2147457200","https://openalex.org/W2276575217","https://openalex.org/W190963404","https://openalex.org/W2141950114","https://openalex.org/W1604386627","https://openalex.org/W4372324527","https://openalex.org/W2134321370","https://openalex.org/W4214679513","https://openalex.org/W2071306797","https://openalex.org/W1548919438"],"abstract_inverted_index":{"Despite":[0],"the":[1,25,42,59,68,75,99,108,119,125,128,144,150,157,160,163,171,188,194,197,207,216,219,231,267,276,329],"many":[2],"recent":[3],"practical":[4],"and":[5,110,213,258],"theoretical":[6],"breakthroughs":[7],"in":[8,14,24,187,286],"computational":[9],"game":[10,43,198,319],"theory,":[11],"equilibrium":[12,284],"finding":[13,285],"extensive-form":[15],"team":[16,37,61,91,161,175],"games":[17,176,309],"remains":[18],"a":[19,85,95,178,202,248,253,296,305],"significant":[20],"challenge.":[21],"While":[22],"NP-hard":[23],"worst":[26],"case,":[27],"there":[28],"are":[29,64],"provably":[30],"efficient":[31],"algorithms":[32,78],"for":[33,89,115,234,289,332],"certain":[34],"families":[35],"of":[36,98,112,118,127,138,143,173,196,209,218,236,278,308],"game.":[38],"In":[39,80,222],"particular,":[40],"if":[41],"has":[44,124,165,269],"common":[45,72,154],"external":[46,211],"information,":[47,212],"also":[48,324],"known":[49],"as":[50],"A-loss":[51],"recall---informally,":[52],"actions":[53],"played":[54],"by":[55,230],"non-team":[56],"members":[57],"(i.e.,":[58],"opposing":[60],"or":[62,71],"nature)":[63],"either":[65],"unknown":[66],"to":[67,106,132,177,251,294,326],"entire":[69],"team,":[70],"knowledge":[73,155],"within":[74],"team---then":[76],"polynomial-time":[77],"exist.":[79],"this":[81,333],"paper,":[82],"we":[83,282],"devise":[84],"completely":[86],"new":[87,249],"algorithm":[88,169,244,274,312],"solving":[90,174],"games.":[92],"It":[93],"uses":[94],"tree":[96,129,220,256],"decomposition":[97,130,268],"constraint":[100,189],"system":[101],"representing":[102],"each":[103],"team's":[104],"strategy":[105],"reduce":[107],"number":[109],"degree":[111],"constraints":[113],"required":[114],"correctness":[116],"(tightness":[117],"mathematical":[120],"program).":[121],"Our":[122,168,243],"approach":[123],"bags":[126],"correspond":[131],"team-public":[133],"states---that":[134],"is,":[135,141],"minimal":[136],"sets":[137],"nodes":[139],"(that":[140],"states":[142],"team)":[145],"such":[146],"that,":[147],"upon":[148],"reaching":[149],"set,":[151],"it":[152],"is":[153,193,201,215,228,245],"among":[156],"players":[158,238],"on":[159,206,247,304,316],"that":[162,204,266,310],"set":[164],"been":[166],"reached.":[167],"reduces":[170],"problem":[172],"linear":[179],"program":[180,226],"with":[181,239],"at":[182],"most":[183],"O(NW^(w+1))":[184],"nonzero":[185],"entries":[186],"matrix,":[190],"where":[191,335],"N":[192],"size":[195,227],"tree,":[199],"w":[200],"parameter":[203],"depends":[205],"amount":[208],"uncommon":[210],"W":[214],"treewidth":[217],"decomposition.":[221],"public-action":[223],"games,":[224],"our":[225,273,311,327],"bounded":[229],"tighter":[232],"2^(O(nt))N":[233],"teams":[235,337],"n":[237],"t":[240],"types":[241],"each.":[242],"based":[246],"way":[250],"write":[252],"custom,":[254],"concise":[255],"decomposition,":[257],"its":[259],"fast":[260],"run":[261,295],"time":[262],"does":[263],"not":[264],"assume":[265],"small":[270],"treewidth.":[271],"Since":[272],"describes":[275],"polytope":[277],"correlated":[279,287],"strategies":[280,288],"directly,":[281],"get":[283],"free---instead":[290],"of,":[291],"say,":[292],"having":[293],"double":[297],"oracle":[298],"algorithm.":[299],"We":[300,323],"show":[301],"via":[302],"experiments":[303,331],"standard":[306],"suite":[307],"achieves":[313],"state-of-the-art":[314],"performance":[315],"all":[317],"benchmark":[318],"classes":[320],"except":[321],"one.":[322],"present,":[325],"knowledge,":[328],"first":[330],"setting":[334],"both":[336],"have":[338],"more":[339],"than":[340],"one":[341],"member.":[342]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}