{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T06:31:47Z","timestamp":1777530707670,"version":"3.51.4"},"reference-count":67,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,4,23]],"date-time":"2027-04-23T00:00:00Z","timestamp":1808438400000},"content-version":"am","delay-in-days":296,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["A240108S001"],"award-info":[{"award-number":["A240108S001"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100024370","name":"Ministero dell'Istruzione dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100024370","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"US Army Research Office","doi-asserted-by":"publisher","award":["W911NF2210266"],"award-info":[{"award-number":["W911NF2210266"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["RI-1901403"],"award-info":[{"award-number":["RI-1901403"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["RI-2312342"],"award-info":[{"award-number":["RI-2312342"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000009","name":"Foundation for the National Institutes of Health","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000009","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.artint.2026.104529","type":"journal-article","created":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:38:23Z","timestamp":1775230703000},"page":"104529","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Efficient representations for team and imperfect-recall equilibrium computation"],"prefix":"10.1016","volume":"356","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1864-2154","authenticated-orcid":false,"given":"Luca","family":"Carminati","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1267-0170","authenticated-orcid":false,"given":"Brian Hu","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1247-0678","authenticated-orcid":false,"given":"Federico","family":"Cacciamani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6015-0084","authenticated-orcid":false,"given":"Junkang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Gabriele","family":"Farina","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7349-3932","authenticated-orcid":false,"given":"Nicola","family":"Gatti","sequence":"additional","affiliation":[]},{"given":"Tuomas","family":"Sandholm","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.artint.2026.104529_bib0001","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1073\/pnas.36.10.570","article-title":"Extensive games","volume":"36","author":"Kuhn","year":"1950","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"10.1016\/j.artint.2026.104529_bib0002","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1006\/game.1996.0050","article-title":"Efficient computation of behavior strategies","volume":"14","author":"von Stengel","year":"1996","journal-title":"Game. Econ. Behav."},{"key":"10.1016\/j.artint.2026.104529_bib0003","article-title":"Reduction of a game with complete memory to a matrix game","volume":"3","author":"Romanovskii","year":"1962","journal-title":"Soviet Math."},{"key":"10.1016\/j.artint.2026.104529_bib0004","series-title":"Conference on Neural Information Processing Systems (NeurIPS)","article-title":"Regret minimization in games with incomplete information","author":"Zinkevich","year":"2007"},{"key":"10.1016\/j.artint.2026.104529_bib0005","series-title":"International Joint Conference on Artificial Intelligence (IJCAI)","article-title":"Solving heads-up limit texas Hold\u2019em","author":"Tammelin","year":"2015"},{"key":"10.1016\/j.artint.2026.104529_bib0006","series-title":"AAAI Conference on Artificial Intelligence (AAAI)","article-title":"Solving imperfect-information games via discounted regret minimization","author":"Brown","year":"2019"},{"key":"10.1016\/j.artint.2026.104529_bib0007","series-title":"AAAI Conference on Artificial Intelligence (AAAI)","article-title":"Faster game solving via predictive Blackwell approachability: connecting regret matching and mirror descent","author":"Farina","year":"2021"},{"key":"10.1016\/j.artint.2026.104529_bib0008","unstructured":"N. Zhang, S. McAleer, T. Sandholm, Faster Game Solving via Hyperparameter Schedules, arXiv preprint arXiv:2404.09097 (2024)."},{"key":"10.1016\/j.artint.2026.104529_bib0009","series-title":"AAAI Conference on Artificial Intelligence (AAAI)","article-title":"Abstraction for solving large incomplete-information games","author":"Sandholm","year":"2015"},{"issue":"6218","key":"10.1016\/j.artint.2026.104529_bib0010","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1126\/science.aaa4614","article-title":"Solving imperfect-information games","volume":"347","author":"Sandholm","year":"2015","journal-title":"Science"},{"key":"10.1016\/j.artint.2026.104529_bib0011","series-title":"National Conference on Artificial Intelligence (AAAI)","article-title":"A competitive Texas hold\u2019em poker player via automated abstraction and real-time equilibrium computation","author":"Gilpin","year":"2006"},{"key":"10.1016\/j.artint.2026.104529_bib0012","series-title":"International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS)","doi-asserted-by":"crossref","DOI":"10.65109\/UTUK2235","article-title":"Endgame solving in large imperfect-information games","author":"Ganzfried","year":"2015"},{"key":"10.1016\/j.artint.2026.104529_bib0013","series-title":"AAAI Conference on Artificial Intelligence (AAAI)","article-title":"Refining subgames in large imperfect information games","author":"Moravcik","year":"2016"},{"key":"10.1016\/j.artint.2026.104529_bib0014","series-title":"Conference on Neural Information Processing Systems (NeurIPS)","article-title":"Safe and nested subgame solving for imperfect-information games","author":"Brown","year":"2017"},{"key":"10.1016\/j.artint.2026.104529_bib0015","doi-asserted-by":"crossref","DOI":"10.1126\/science.aam6960","article-title":"Deepstack: expert-level artificial intelligence in heads-up no-limit poker","author":"Morav\u010d\u00edk","year":"2017","journal-title":"Science"},{"issue":"6374","key":"10.1016\/j.artint.2026.104529_bib0016","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1126\/science.aao1733","article-title":"Superhuman AI for heads-up no-limit poker: libratus beats top professionals","volume":"359","author":"Brown","year":"2018","journal-title":"Science"},{"issue":"6456","key":"10.1016\/j.artint.2026.104529_bib0017","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1126\/science.aay2400","article-title":"Superhuman AI for multiplayer poker","volume":"365","author":"Brown","year":"2019","journal-title":"Science"},{"issue":"6218","key":"10.1016\/j.artint.2026.104529_bib0018","doi-asserted-by":"crossref","DOI":"10.1126\/science.1259433","article-title":"Heads-up limit hold\u2019em poker is solved","volume":"347","author":"Bowling","year":"2015","journal-title":"Science"},{"issue":"6623","key":"10.1016\/j.artint.2026.104529_bib0019","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1126\/science.add4679","article-title":"Mastering the game of Stratego with model-free multiagent reinforcement learning","volume":"378","author":"Perolat","year":"2022","journal-title":"Science"},{"issue":"6624","key":"10.1016\/j.artint.2026.104529_bib0020","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1126\/science.ade9097","article-title":"Human-level play in the game of diplomacy by combining language models with strategic reasoning","volume":"378","author":"Bakhtin","year":"2022","journal-title":"Science"},{"issue":"4","key":"10.1016\/j.artint.2026.104529_bib0021","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/0899-8256(92)90035-Q","article-title":"The complexity of two-person zero-sum games in extensive form","volume":"4","author":"Koller","year":"1992","journal-title":"Game. Econ. Behav."},{"key":"10.1016\/j.artint.2026.104529_bib0022","series-title":"Abstraction in Large Extensive Games","author":"Waugh","year":"2009"},{"key":"10.1016\/j.artint.2026.104529_bib0023","series-title":"International Conference on Machine Learning (ICML)","article-title":"No-regret learning in extensive-form games with imperfect recall","author":"Lanctot","year":"2012"},{"key":"10.1016\/j.artint.2026.104529_bib0024","series-title":"ACM Conference on Economics and Computation (EC)","article-title":"Imperfect-recall abstractions with bounds in games","author":"Kroer","year":"2016"},{"key":"10.1016\/j.artint.2026.104529_bib0025","series-title":"Behavioral Game Theory: Experiments in Strategic Interaction","author":"Camerer","year":"2003"},{"key":"10.1016\/j.artint.2026.104529_bib0026","series-title":"International Joint Conference on Artificial Intelligence (IJCAI)","article-title":"Defender (Mis)coordination in security games","author":"Jiang","year":"2013"},{"key":"10.1016\/j.artint.2026.104529_bib0027","series-title":"Contributions to the Theory of Games","first-page":"193","article-title":"Extensive games and the problem of information","volume":"volume 2","author":"Kuhn","year":"1953"},{"key":"10.1016\/j.artint.2026.104529_bib0028","series-title":"International Conference on Machine Learning","article-title":"Regret circuits: composability of regret minimizers","author":"Farina","year":"2019"},{"key":"10.1016\/j.artint.2026.104529_bib0029","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01448847","article-title":"Zur theorie der gesellschaftsspiele","volume":"100","author":"von Neumann","year":"1928","journal-title":"Mathematische Annalen"},{"key":"10.1016\/j.artint.2026.104529_bib0030","series-title":"International Conference on Machine Learning (ICML)","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"Zinkevich","year":"2003"},{"key":"10.1016\/j.artint.2026.104529_bib0031","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1111\/1468-0262.00153","article-title":"A simple adaptive procedure leading to correlated equilibrium","volume":"68","author":"Hart","year":"2000","journal-title":"Econometrica"},{"issue":"1","key":"10.1016\/j.artint.2026.104529_bib0032","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1006\/game.1997.0527","article-title":"Team-maxmin equilibria","volume":"21","author":"von Stengel","year":"1997","journal-title":"Game. Econ. Behav."},{"key":"10.1016\/j.artint.2026.104529_bib0033","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","article-title":"Computational results for extensive-form adversarial team games","author":"Celli","year":"2018"},{"key":"10.1016\/j.artint.2026.104529_bib0034","series-title":"International Joint Conference on Artificial Intelligence (IJCAI)","article-title":"The computational complexity of single-player imperfect-recall games","author":"Tewolde","year":"2023"},{"key":"10.1016\/j.artint.2026.104529_bib0035","series-title":"Autonomous Agents and Multi-Agent Systems","article-title":"A bridge between polynomial optimization and games with imperfect recall","author":"Gimbert","year":"2020"},{"key":"10.1016\/j.artint.2026.104529_bib0036","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.ijar.2017.11.010","article-title":"Approximating maxmin strategies in imperfect recall games using A-loss recall property","volume":"93","author":"\u010cerm\u00e1k","year":"2018","journal-title":"Int. J. Approxim. Reason."},{"issue":"2","key":"10.1016\/j.artint.2026.104529_bib0037","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01240038","article-title":"Behavior strategies, mixed strategies and perfect recall","volume":"24","author":"Kaneko","year":"1995","journal-title":"Int. J. Game Theory"},{"key":"10.1016\/j.artint.2026.104529_bib0038","series-title":"International Conference on Machine Learning","article-title":"Planning in the presence of cost functions controlled by an adversary","author":"McMahan","year":"2003"},{"key":"10.1016\/j.artint.2026.104529_bib0039","series-title":"Conference on Neural Information Processing Systems (NeurIPS)","article-title":"Ex ante coordination and collusion in zero-sum multi-player extensive-form games","author":"Farina","year":"2018"},{"key":"10.1016\/j.artint.2026.104529_bib0040","series-title":"AAAI Conference on Artificial Intelligence (AAAI)","article-title":"Computing ex ante coordinated team-maxmin equilibria in zero-sum multiplayer extensive-form games","author":"Zhang","year":"2021"},{"key":"10.1016\/j.artint.2026.104529_bib0041","series-title":"ACM Conference on Economics and Computation (EC)","article-title":"Optimal correlated equilibria in general-sum extensive-form games: fixed-parameter algorithms, hardness, and two-sided column-generation","author":"Zhang","year":"2022"},{"key":"10.1016\/j.artint.2026.104529_bib0042","series-title":"International Conference on Machine Learning (ICML)","article-title":"Converging to team-maxmin equilibria in zero-sum multiplayer games","author":"Zhang","year":"2020"},{"issue":"7","key":"10.1016\/j.artint.2026.104529_bib0043","doi-asserted-by":"crossref","first-page":"1644","DOI":"10.1109\/TAC.2013.2239000","article-title":"Decentralized stochastic control with partial history sharing: a common information approach","volume":"58","author":"Nayyar","year":"2013","journal-title":"IEEE Trans. Automat. Contr."},{"key":"10.1016\/j.artint.2026.104529_bib0044","series-title":"Proceedings of the 36th International Conference on Machine Learning","article-title":"Bayesian action decoder for deep multi-agent reinforcement learning","volume":"97","author":"Foerster","year":"2019"},{"key":"10.1016\/j.artint.2026.104529_bib0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2021.103645","article-title":"Rethinking formal models of partially observable multiagent decision making","volume":"303","author":"Kova\u0159\u00edk","year":"2022","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2026.104529_bib0046","series-title":"Technical Report","article-title":"Measuring the Size of Large No-Limit Poker Games","author":"Johanson","year":"2013"},{"key":"10.1016\/j.artint.2026.104529_bib0047","series-title":"Conference on Neural Information Processing Systems (NeurIPS)","article-title":"Polynomial-time optimal equilibria with a mediator in extensive-form games","author":"Zhang","year":"2022"},{"key":"10.1016\/j.artint.2026.104529_bib0048","series-title":"Conference on Neural Information Processing Systems (NeurIPS)","article-title":"Computing optimal equilibria and mechanisms via learning in zero-sum extensive-form games","author":"Zhang","year":"2023"},{"key":"10.1016\/j.artint.2026.104529_bib0049","doi-asserted-by":"crossref","unstructured":"B.H. Zhang, I. Anagnostides, G. Farina, T. Sandholm, Efficient \u03a6-regret minimization with low-degree swap deviations in extensive-form games, 2024a,. arXiv.","DOI":"10.52202\/079017-3976"},{"key":"10.1016\/j.artint.2026.104529_bib0050","series-title":"International Conference on Learning Representations","article-title":"Mediator interpretation and faster learning algorithms for linear correlated equilibria in general extensive-form games","author":"Zhang","year":"2024"},{"issue":"2","key":"10.1016\/j.artint.2026.104529_bib0051","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.ic.2005.05.001","article-title":"Tight lower bounds for certain parameterized NP-hard problems","volume":"201","author":"Chen","year":"2005","journal-title":"Inform. Comput."},{"key":"10.1016\/j.artint.2026.104529_bib0052","doi-asserted-by":"crossref","DOI":"10.1007\/s001820100066","article-title":"On the NP-completeness of finding an optimal strategy in games with common payoffs","author":"Chu","year":"2001","journal-title":"Int. J. Game Theory"},{"issue":"4","key":"10.1016\/j.artint.2026.104529_bib0053","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1287\/moor.1080.0340","article-title":"Extensive-form correlated equilibrium: definition and computational complexity","volume":"33","author":"von Stengel","year":"2008","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.artint.2026.104529_bib0054","series-title":"Contributions to the Theory of Games","first-page":"97","article-title":"A simplified two-person poker","volume":"volume 1","author":"Kuhn","year":"1950"},{"key":"10.1016\/j.artint.2026.104529_bib0055","series-title":"Conference on Uncertainty in Artificial Intelligence (UAI)","article-title":"Bayes\u2019 bluff: opponent modelling in poker","author":"Southey","year":"2005"},{"key":"10.1016\/j.artint.2026.104529_bib0056","series-title":"Autonomous Agents and Multi-Agent Systems","article-title":"Online monte carlo counterfactual regret minimization for search in imperfect information games","author":"Lis\u1ef3","year":"2015"},{"key":"10.1016\/j.artint.2026.104529_bib0057","series-title":"International Conference on Machine Learning","article-title":"Connecting optimal ex-ante collusion in teams to extensive-form correlation: faster algorithms and positive complexity results","author":"Farina","year":"2021"},{"key":"10.1016\/j.artint.2026.104529_bib0058","series-title":"Conference on Neural Information Processing Systems (NeurIPS)","article-title":"Polynomial-time computation of optimal correlated equilibria in two-player extensive-form games with public chance moves and beyond","author":"Farina","year":"2020"},{"issue":"4","key":"10.1016\/j.artint.2026.104529_bib0059","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1145\/502090.502098","article-title":"Some optimal inapproximability results","volume":"48","author":"H\u00e5stad","year":"2001","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"10.1016\/j.artint.2026.104529_bib0060","first-page":"32","article-title":"Completeness in the polynomial-time hierarchy: a compendium","volume":"33","author":"Schaefer","year":"2002","journal-title":"SIGACT News"},{"key":"10.1016\/j.artint.2026.104529_bib0061","series-title":"Geometric Algorithms and Combinatorial Optimizations","author":"Grotschel","year":"1993"},{"issue":"3","key":"10.1016\/j.artint.2026.104529_bib0062","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","article-title":"The complexity of optimization problems","volume":"36","author":"Krentel","year":"1988","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.artint.2026.104529_bib0063","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1006\/game.1997.0536","article-title":"On the interpretation of decision problems with imperfect recall","volume":"20","author":"Piccione","year":"1997","journal-title":"Game. Econ. Behav."},{"issue":"2","key":"10.1016\/j.artint.2026.104529_bib0064","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/3055589.3055596","article-title":"Settling the complexity of computing approximate two-player Nash equilibria","volume":"15","author":"Rubinstein","year":"2017","journal-title":"ACM SIGecom Exchange."},{"key":"10.1016\/j.artint.2026.104529_bib0065","series-title":"AAAI Conference on Artificial Intelligence (AAAI)","article-title":"Team correlated equilibria in zero-sum extensive-form games via tree decompositions","author":"Zhang","year":"2022"},{"key":"10.1016\/j.artint.2026.104529_bib0066","series-title":"NeurIPS Cooperative AI Workshop","article-title":"Public information representation for adversarial team games","author":"Carminati","year":"2021"},{"key":"10.1016\/j.artint.2026.104529_bib0067","series-title":"Graphical models, exponential families, and variational inference","author":"Wainwright","year":"2008"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S000437022600055X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S000437022600055X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T16:43:25Z","timestamp":1777394605000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S000437022600055X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":67,"alternative-id":["S000437022600055X"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2026.104529","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient representations for team and imperfect-recall equilibrium computation","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.artint.2026.104529","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104529"}}