{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T13:23:54Z","timestamp":1777728234278,"version":"3.51.4"},"reference-count":48,"publisher":"SAGE Publications","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IA"],"published-print":{"date-parts":[[2019,1,28]]},"DOI":"10.3233\/ia-180006","type":"journal-article","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T11:56:09Z","timestamp":1548762969000},"page":"89-101","source":"Crossref","is-referenced-by-count":0,"title":["Learning dynamics in limited-control repeated games"],"prefix":"10.1177","volume":"12","author":[{"given":"Andrea","family":"Celli","sequence":"first","affiliation":[{"name":"Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Piazza Leonardo da Vinci 32, Milano, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Marchesi","sequence":"additional","affiliation":[{"name":"Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Piazza Leonardo da Vinci 32, Milano, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"1","key":"10.3233\/IA-180006_ref1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.3233\/IA-170107","article-title":"Computing the team\u2013maxmin equilibrium in single\u2013team single\u2013adversary team games","volume":"11","author":"Basilico","year":"2017","journal-title":"Intelligenza Artificiale"},{"key":"10.3233\/IA-180006_ref2","unstructured":"Basilico N. , Celli A. , De Nittis G. and Gatti N.. Coordinating multiple defensive resources in patrolling games with alarm systems. In AAMAS, 2017."},{"key":"10.3233\/IA-180006_ref3","doi-asserted-by":"crossref","unstructured":"Basilico N. , Celli A. , De Nittis G. and Gatti N.. Team-maxmin equilibrium: Efficiency bounds and algorithms. In AAAI, 2017.","DOI":"10.1609\/aaai.v31i1.10560"},{"key":"10.3233\/IA-180006_ref4","first-page":"1","article-title":"Bilevel programming approaches to the computation of optimistic and pessimistic single-leader-multi-follower equilibria","volume":"75","author":"Basilico","year":"2017","journal-title":"Leibniz International Proceedings in Informatics"},{"issue":"4","key":"10.3233\/IA-180006_ref5","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","article-title":"Robust convex optimization","volume":"23","author":"Ben-Tal","year":"1998","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"10.3233\/IA-180006_ref6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","article-title":"Robust solutions of uncertain linear programs","volume":"25","author":"Ben-Tal","year":"1999","journal-title":"Operations Research Letters"},{"issue":"2","key":"10.3233\/IA-180006_ref7","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1137\/S1052623401392354","article-title":"Robust solutions of uncertain quadratic and conic-quadratic problems","volume":"13","author":"Ben-Tal","year":"2002","journal-title":"SIAM Journal on Optimization"},{"issue":"6218","key":"10.3233\/IA-180006_ref8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1126\/science.1259433","article-title":"Headsup limit hold\u2019em poker is solved","volume":"347","author":"Bowling","year":"2015","journal-title":"Science"},{"issue":"1","key":"10.3233\/IA-180006_ref9","first-page":"374","article-title":"Iterative solution of games by fictitious play","volume":"13","author":"Brown","year":"1951","journal-title":"Activity Analysis of Production and Allocation"},{"key":"10.3233\/IA-180006_ref10","unstructured":"Brown N. and Sandholm T. , Safe and nested subgame solving for imperfect-information games. In NIPS, 2017."},{"key":"10.3233\/IA-180006_ref11","first-page":"eaao1733","article-title":"Superhuman AI for heads-up nolimit poker: Libratus beats top professionals","author":"Brown","year":"2017","journal-title":"Science"},{"issue":"1","key":"10.3233\/IA-180006_ref12","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-003-0499-y","article-title":"Uncertain convex programs: Randomized solutions and confidence levels","volume":"102","author":"Calafiore","year":"2005","journal-title":"Mathematical Programming"},{"issue":"2","key":"10.3233\/IA-180006_ref13","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/j.automatica.2008.09.004","article-title":"Interval predictor models: Identification and reliability","volume":"45","author":"Campi","year":"2009","journal-title":"Automatica"},{"issue":"3","key":"10.3233\/IA-180006_ref14","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1137\/07069821X","article-title":"The exact feasibility of randomized solutions of uncertain convex programs","volume":"19","author":"Campi","year":"2008","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"10.3233\/IA-180006_ref15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.arcontrol.2009.07.001","article-title":"The scenario approach for systems and control design","volume":"33","author":"Campi","year":"2009","journal-title":"Annual Reviews in Control"},{"key":"10.3233\/IA-180006_ref16","doi-asserted-by":"crossref","unstructured":"Celli A. and Gatti N. , Computational results for extensive-form adversarial team games. In AAAI, 2018.","DOI":"10.1609\/aaai.v32i1.11462"},{"key":"10.3233\/IA-180006_ref17","unstructured":"Celli A. , Marchesi A. and Gatti N. , On the complexity of Nash equilibrium reoptimization. In UAI, 2017."},{"key":"10.3233\/IA-180006_ref18","doi-asserted-by":"crossref","unstructured":"\u010cerm\u00e1k J. , Bo\u0161ansky B. and Lisy V.. An algorithm for constructing and solving imperfect recall abstractions of large extensive-form games. In AAAI, 2017.","DOI":"10.24963\/ijcai.2017\/130"},{"key":"10.3233\/IA-180006_ref19","doi-asserted-by":"crossref","unstructured":"Coniglio S. , Gatti N. and Marchesi A. , Pessimistic leaderfollower equilibria with multiple followers. In IJCAI, 2017.","DOI":"10.24963\/ijcai.2017\/25"},{"key":"10.3233\/IA-180006_ref20","doi-asserted-by":"crossref","unstructured":"Conitzer V. and Sandholm T. , Computing the optimal strategy to commit to. In EC, 2006.","DOI":"10.1145\/1134707.1134717"},{"issue":"2","key":"10.3233\/IA-180006_ref21","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/j.geb.2008.02.015","article-title":"New complexity results about Nash equilibria","volume":"63","author":"Conitzer","year":"2008","journal-title":"Games and Economic Behavior"},{"issue":"1","key":"10.3233\/IA-180006_ref22","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/070699652","article-title":"The complexity of computing a Nash equilibrium","volume":"39","author":"Daskalakis","year":"2009","journal-title":"SIAM Journal on Computing"},{"key":"10.3233\/IA-180006_ref23","doi-asserted-by":"crossref","unstructured":"De Nittis G. , Marchesi A. and Gatti N.. Computing the strategy to commit to in polymatrix games. In AAAI, 2018.","DOI":"10.1609\/aaai.v32i1.11456"},{"key":"10.3233\/IA-180006_ref24","unstructured":"Farina G. , Celli A. , Gatti N. and Sandholm T. , Ex ante coordination and collusion in zero-sum multi-player extensive-form games. In NIPS, 2018."},{"key":"10.3233\/IA-180006_ref25","unstructured":"Farina G. , Kroer C. and Sandholm T. , Regret minimization in behaviorally-constrained zero-sum games. In ICML, 2017."},{"key":"10.3233\/IA-180006_ref26","doi-asserted-by":"crossref","unstructured":"Farina G. , Marchesi A. , Kroer C. , Gatti N. and Sandholm T. , Trembling-hand perfection in extensive-form games with commitment. In IJCAI, 2018.","DOI":"10.24963\/ijcai.2018\/32"},{"key":"10.3233\/IA-180006_ref27","volume-title":"The theory of learning in games","author":"Fudenberg","year":"1998"},{"key":"10.3233\/IA-180006_ref28","volume-title":"The theory of learning in games","author":"Fudenberg","year":"1998"},{"key":"10.3233\/IA-180006_ref29","unstructured":"Heinrich J. , Lanctot M. and Silver D. , Fictitious self-play in extensive-form games. In ICML, 2015."},{"key":"10.3233\/IA-180006_ref30","unstructured":"Kiekintveld C. , Islam T. and Kreinovich V. , Security games with interval uncertainty. In AAMAS, 2013."},{"issue":"2","key":"10.3233\/IA-180006_ref31","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1006\/game.1996.0051","article-title":"Efficient computation of equilibria for extensive two-person games","volume":"14","author":"Koller","year":"1996","journal-title":"Games and Economic Behavior"},{"key":"10.3233\/IA-180006_ref32","first-page":"97","article-title":"A simplified two-person poker","volume":"1","author":"Kuhn","year":"1950","journal-title":"Contributions to the Theory of Games"},{"key":"10.3233\/IA-180006_ref33","first-page":"193","volume":"2","author":"Kuhn","year":"1953","journal-title":"Extensive games and the problem of information"},{"key":"10.3233\/IA-180006_ref34","unstructured":"Lanctot M. , Waugh K. , Zinkevich M. and Bowling M. , Monte carlo sampling for regret minimization in extensive games. In NIPS, 2009."},{"key":"10.3233\/IA-180006_ref35","doi-asserted-by":"crossref","unstructured":"Marchesi A. , Coniglio S. and Gatti N. , Leadership in singleton congestion games. In IJCAI, 2018.","DOI":"10.24963\/ijcai.2018\/62"},{"key":"10.3233\/IA-180006_ref36","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511794216","volume-title":"Game Theory","author":"Maschler","year":"2013"},{"key":"10.3233\/IA-180006_ref37","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1073\/pnas.36.1.48","article-title":"Equilibrium points in n-person games","volume":"36","author":"Nash","year":"1950","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"10.3233\/IA-180006_ref38","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","article-title":"Non-cooperative games","author":"Nash","year":"1951","journal-title":"Annals of mathematics"},{"key":"10.3233\/IA-180006_ref39","doi-asserted-by":"crossref","unstructured":"Nguyen T.H. , Yang R. , Azaria A. , Kraus S. and Tambe M. , Analyzing the effectiveness of adversary modeling in security games. In AAAI, 2013.","DOI":"10.1609\/aaai.v27i1.8599"},{"key":"10.3233\/IA-180006_ref40","doi-asserted-by":"crossref","unstructured":"Nuara A. , Trov\u00f2 F. , Gatti N. and Restelli M. , A combinatorialbandit algorithm for the online joint bid\/budget optimization of pay-per-click advertising campaigns. In AAAI, 2018.","DOI":"10.1609\/aaai.v32i1.11888"},{"key":"10.3233\/IA-180006_ref41","doi-asserted-by":"crossref","first-page":"296","DOI":"10.2307\/1969530","article-title":"An iterative method of solving a game","author":"Robinson","year":"1951","journal-title":"Annals of Mathematics"},{"key":"10.3233\/IA-180006_ref42","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511811654","volume-title":"Multiagent systems: Algorithmic, game-theoretic, and logical foundations","author":"Shoham","year":"2008"},{"key":"10.3233\/IA-180006_ref43","unstructured":"Southey F. , Bowling M. , Larson B. , Piccione C. , Burch N. , Billings D. and Rayner C. , Bayes\u2019 bluff: Opponent modeling in poker. In UAI, 2005."},{"key":"10.3233\/IA-180006_ref44","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511973031","volume-title":"Security and game theory: Algorithms, deployed systems, lessons learned","author":"Tambe","year":"2011"},{"key":"10.3233\/IA-180006_ref45","unstructured":"Tammelin O. , Burch N. , Johanson M. and Bowling M. , Solving heads-up limit texas hold\u2019em. In IJCAI, 2015."},{"key":"10.3233\/IA-180006_ref46","volume-title":"Marktform und Gleichgewicht","author":"von Stackelberg","year":"1934"},{"issue":"2","key":"10.3233\/IA-180006_ref47","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":"Games and Economic Behavior"},{"key":"10.3233\/IA-180006_ref48","unstructured":"Zinkevich M. , Johanson M. , Bowling M. and Piccione C. , Regret minimization in games with incomplete information. In NIPS, 2008."}],"container-title":["Intelligenza Artificiale"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IA-180006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:51:34Z","timestamp":1777459894000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospress&doi=10.3233\/IA-180006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,28]]},"references-count":48,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.3233\/ia-180006","relation":{},"ISSN":["1724-8035","2211-0097"],"issn-type":[{"value":"1724-8035","type":"print"},{"value":"2211-0097","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,28]]}}}