{"id":"https://openalex.org/W7160295318","doi":"https://doi.org/10.48550/arxiv.2605.01841","title":"Efficient representations for team and imperfect-recall equilibrium computation","display_name":"Efficient representations for team and imperfect-recall equilibrium computation","publication_year":2026,"publication_date":"2026-05-03","ids":{"openalex":"https://openalex.org/W7160295318","doi":"https://doi.org/10.48550/arxiv.2605.01841"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.01841","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.01841","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.01841","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135363851","display_name":"Luca Carminati","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Carminati, Luca","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135410970","display_name":"Brian Hu Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Brian Hu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012318258","display_name":"Federico Cacciamani","orcid":"https://orcid.org/0000-0003-1247-0678"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cacciamani, Federico","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135402545","display_name":"Junkang Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Junkang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135370329","display_name":"Gabriele Farina","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Farina, Gabriele","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135342500","display_name":"Nicola Gatti","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gatti, Nicola","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135300492","display_name":"Tuomas Sandholm","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sandholm, Tuomas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_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_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.6402000188827515,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.6402000188827515,"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/T11031","display_name":"Game Theory and Applications","score":0.13289999961853027,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.032499998807907104,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.6771000027656555},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.6050999760627747},{"id":"https://openalex.org/keywords/extensive-form-game","display_name":"Extensive-form game","score":0.5638999938964844},{"id":"https://openalex.org/keywords/equilibrium-selection","display_name":"Equilibrium selection","score":0.5526999831199646},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.5174000263214111},{"id":"https://openalex.org/keywords/repeated-game","display_name":"Repeated game","score":0.45350000262260437},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.44339999556541443},{"id":"https://openalex.org/keywords/normal-form-game","display_name":"Normal-form game","score":0.44029998779296875},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.4318999946117401},{"id":"https://openalex.org/keywords/solution-concept","display_name":"Solution concept","score":0.4162999987602234}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.6771000027656555},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.6050999760627747},{"id":"https://openalex.org/C146930158","wikidata":"https://www.wikidata.org/wiki/Q656416","display_name":"Extensive-form game","level":4,"score":0.5638999938964844},{"id":"https://openalex.org/C164407509","wikidata":"https://www.wikidata.org/wiki/Q5384490","display_name":"Equilibrium selection","level":4,"score":0.5526999831199646},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.5174000263214111},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.515500009059906},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.4997999966144562},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.45350000262260437},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.44339999556541443},{"id":"https://openalex.org/C155930848","wikidata":"https://www.wikidata.org/wiki/Q1069099","display_name":"Normal-form game","level":4,"score":0.44029998779296875},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.4318999946117401},{"id":"https://openalex.org/C11343654","wikidata":"https://www.wikidata.org/wiki/Q780008","display_name":"Solution concept","level":3,"score":0.4162999987602234},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.41499999165534973},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.3946000039577484},{"id":"https://openalex.org/C163630976","wikidata":"https://www.wikidata.org/wiki/Q964667","display_name":"Correlated equilibrium","level":5,"score":0.39320001006126404},{"id":"https://openalex.org/C93826744","wikidata":"https://www.wikidata.org/wiki/Q903738","display_name":"Game complexity","level":4,"score":0.37959998846054077},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.3734000027179718},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.3702000081539154},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36640000343322754},{"id":"https://openalex.org/C141824439","wikidata":"https://www.wikidata.org/wiki/Q307521","display_name":"Epsilon-equilibrium","level":4,"score":0.365200012922287},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3628999888896942},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3605000078678131},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.3578999936580658},{"id":"https://openalex.org/C88959737","wikidata":"https://www.wikidata.org/wiki/Q1546627","display_name":"Strategy","level":3,"score":0.35690000653266907},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.34850001335144043},{"id":"https://openalex.org/C102234262","wikidata":"https://www.wikidata.org/wiki/Q1320931","display_name":"Combinatorial game theory","level":4,"score":0.3474000096321106},{"id":"https://openalex.org/C2780310539","wikidata":"https://www.wikidata.org/wiki/Q12547192","display_name":"Imperfect","level":2,"score":0.3465000092983246},{"id":"https://openalex.org/C123676819","wikidata":"https://www.wikidata.org/wiki/Q1074338","display_name":"Perfect information","level":2,"score":0.3449999988079071},{"id":"https://openalex.org/C22349654","wikidata":"https://www.wikidata.org/wiki/Q2039354","display_name":"Risk dominance","level":5,"score":0.3086000084877014},{"id":"https://openalex.org/C101097943","wikidata":"https://www.wikidata.org/wiki/Q5176983","display_name":"Counterintuitive","level":2,"score":0.3086000084877014},{"id":"https://openalex.org/C93733245","wikidata":"https://www.wikidata.org/wiki/Q3770642","display_name":"Symmetric game","level":5,"score":0.30559998750686646},{"id":"https://openalex.org/C69663246","wikidata":"https://www.wikidata.org/wiki/Q623221","display_name":"Algorithmic game theory","level":4,"score":0.30070000886917114},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.2994999885559082},{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C2778079155","wikidata":"https://www.wikidata.org/wiki/Q288500","display_name":"Potential game","level":3,"score":0.2782000005245209},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.2759000062942505}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.01841","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.01841","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.01841","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.01841","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Equilibrium":[0],"finding":[1,183],"in":[2,19,132,186],"two-player":[3,32,96],"zero-sum":[4,33,42,97],"games":[5,34,196],"with":[6,35,61,73,99,207],"perfect":[7],"recall":[8],"is":[9,63,87],"a":[10,51,57,78,88,93,141,145,215],"well-studied":[11],"topic":[12],"that":[13,124,202],"has":[14],"led":[15],"to":[16,26,30,40,65,92,144],"many":[17],"breakthroughs":[18],"computational":[20],"game":[21,90,98,104,112,135],"theory.":[22],"This":[23,86],"paper":[24],"aims":[25],"generalize":[27],"such":[28],"techniques":[29],"(timeable)":[31,95],"imperfect":[36,100],"recall,":[37],"or":[38],"equivalently":[39],"two-team":[41],"games.":[43,221],"In":[44],"this":[45,151],"setting,":[46],"the":[47,70,83,110,125,129,133,152,167,175,193,203],"problem":[48],"of":[49,128,169,182,195,218],"computing":[50],"mixed-strategy":[52],"Nash":[53,184],"equilibrium":[54,60],"(or,":[55],"equivalently,":[56],"team":[58,153,220],"maxmin":[59],"correlation)":[62],"known":[64],"be":[66,106,115,137],"NP-hard.":[67],"We":[68,121,149],"connect":[69],"imperfect-recall":[71],"setting":[72],"its":[74],"perfect-recall":[75,89],"counterpart":[76],"through":[77],"novel":[79],"construction":[80],"we":[81,177,197,200],"call":[82,150],"belief":[84,103,134,154],"game.":[85],"equivalent":[91],"given":[94],"recall.":[101],"The":[102,157],"may":[105],"exponentially":[107],"larger":[108],"than":[109],"original":[111],"but":[113],"can":[114,136],"solved":[116],"using":[117],"any":[118],"standard":[119],"method.":[120],"then":[122],"show":[123,178,201],"strategy":[126],"spaces":[127],"two":[130],"players":[131],"directly":[138],"represented":[139],"as":[140],"DAG,":[142],"leading":[143],"possibly":[146],"exponential":[147],"speedup.":[148],"DAG":[155],"(TB-DAG).":[156],"TB-DAG":[158],"simultaneously":[159],"enjoys":[160],"essentially":[161],"optimal":[162],"parameterized":[163],"complexity":[164],"bounds":[165],"and":[166,180,189],"advantages":[168],"efficient":[170],"regret":[171],"minimization":[172],"techniques.":[173],"Along":[174],"way,":[176],"$\u0394_2^P$-completeness":[179],"$\u03a3_2^P$-completeness":[181],"equilibria":[185],"both":[187],"mixed":[188],"behavioral":[190],"strategies":[191],"for":[192],"class":[194],"consider.":[198],"Experimentally,":[199],"TB-DAG,":[204],"when":[205],"paired":[206],"existing":[208],"learning":[209],"techniques,":[210],"yields":[211],"state-of-the-art":[212],"performance":[213],"on":[214],"wide":[216],"variety":[217],"benchmark":[219]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-06T00:00:00"}