{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:45:14Z","timestamp":1743140714620,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031208614"},{"type":"electronic","value":"9783031208621"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20862-1_7","type":"book-chapter","created":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T23:29:12Z","timestamp":1667518152000},"page":"90-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Faster Optimistic Online Mirror Descent for\u00a0Extensive-Form Games"],"prefix":"10.1007","author":[{"given":"Huacong","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,4]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Nash, J.: Non-cooperative games. Ann. Math., 286\u2013295 (1951)","DOI":"10.2307\/1969529"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a nash equilibrium. SIAM J. Comput. 39(1), 195\u2013259 (2009)","journal-title":"SIAM J. Comput."},{"key":"7_CR3","unstructured":"Tammelin, O., Burch, N., Johanson, M., Bowling, M.: Solving heads-up limit Texas Hold\u2019em. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)"},{"issue":"6218","key":"7_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1126\/science.1259433","volume":"347","author":"M Bowling","year":"2015","unstructured":"Bowling, M., Burch, N., Johanson, M., Tammelin, O.: Heads-up limit Hold\u2019em poker is solved. Science 347(6218), 145\u2013149 (2015)","journal-title":"Science"},{"issue":"6374","key":"7_CR5","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1126\/science.aao1733","volume":"359","author":"N Brown","year":"2018","unstructured":"Brown, N., Sandholm, T.: Superhuman AI for heads-up no-limit poker: Libratus beats top professionals. Science 359(6374), 418\u2013424 (2018)","journal-title":"Science"},{"issue":"5","key":"7_CR6","doi-asserted-by":"publisher","first-page":"25-es","DOI":"10.1145\/1284320.1284324","volume":"54","author":"A Gilpin","year":"2007","unstructured":"Gilpin, A., Sandholm, T.: Lossless abstraction of imperfect information games. J. ACM (JACM) 54(5), 25-es (2007)","journal-title":"J. ACM (JACM)"},{"key":"7_CR7","unstructured":"Brown, N., Ganzfried, S., Sandholm, T.: Hierarchical abstraction, distributed equilibrium computation, and post-processing, with application to a champion no-limit Texas Hold\u2019em agent. In: Workshops at the Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)"},{"key":"7_CR8","unstructured":"Ganzfried, S., Sandholm, T.: Endgame solving in large imperfect-information games. In: Workshops at the Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Moravcik, M., Schmid, M., Ha, K., Hladik, M., Gaukrodger, S.: Refining subgames in large imperfect information games. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 30 (2016)","DOI":"10.1609\/aaai.v30i1.10033"},{"issue":"6456","key":"7_CR10","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1126\/science.aay2400","volume":"365","author":"N Brown","year":"2019","unstructured":"Brown, N., Sandholm, T.: Superhuman AI for multiplayer poker. Science 365(6456), 885\u2013890 (2019)","journal-title":"Science"},{"key":"7_CR11","unstructured":"Heinrich, J., Silver, D.: Deep reinforcement learning from self-play in imperfect-information games. arXiv preprint arXiv:1603.01121 (2016)"},{"key":"7_CR12","unstructured":"Zinkevich, M., Johanson, M., Bowling, M., Piccione, C.: Regret minimization in games with incomplete information. In: Advances in Neural Information Processing Systems, vol. 20 (2007)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Brown, N., Sandholm, T.: Solving imperfect-information games via discounted regret minimization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 1829\u20131836 (2019)","DOI":"10.1609\/aaai.v33i01.33011829"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Liu, W., Li, B., Togelius, J.: Model-free neural counterfactual regret minimization with bootstrap learning. IEEE Trans. Games, 1 (2022)","DOI":"10.1109\/TG.2022.3158649"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Farina, G., Kroer, C., Sandholm, T.: Faster game solving via predictive blackwell approachability: connecting regret matching and mirror descent. arXiv preprint arXiv:2007.14358 (2020)","DOI":"10.1609\/aaai.v35i6.16676"},{"key":"7_CR16","unstructured":"Abernethy, J.D., Hazan, E., Rakhlin, A.: Competing in the dark: an efficient algorithm for bandit linear optimization (2009)"},{"issue":"3","key":"7_CR17","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31(3), 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Hazan, E., et al.: Introduction to online convex optimization. Found. Trends\u00ae Opt. 2(3\u20134), 157\u2013325 (2016)","DOI":"10.1561\/2400000013"},{"key":"7_CR19","unstructured":"Syrgkanis, V., Agarwal, A., Luo, H., Schapire, R.E.: Fast convergence of regularized learning in games. In: Advances in Neural Information Processing Systems, vol. 28 (2015)"},{"key":"7_CR20","unstructured":"Farina, G., Kroer, C., Sandholm, T.: Optimistic regret minimization for extensive-form games via dilated distance-generating functions. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"7_CR21","unstructured":"Lee, C.-W., Kroer, C., Luo, H.: Last-iterate convergence in extensive-form games. In: Advances in Neural Information Processing Systems, vol. 34 (2021)"},{"issue":"1","key":"7_CR22","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10107-018-1336-7","volume":"179","author":"C Kroer","year":"2020","unstructured":"Kroer, C., Waugh, K., K\u0131l\u0131n\u00e7-Karzan, F., Sandholm, T.: Faster algorithms for extensive-form game solving via improved smoothing functions. Math. Program. 179(1), 385\u2013417 (2020)","journal-title":"Math. Program."},{"issue":"2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1006\/game.1996.0051","volume":"14","author":"D Koller","year":"1996","unstructured":"Koller, D., Megiddo, N., Von Stengel, B.: Efficient computation of equilibria for extensive two-person games. Games Econom. Behav. 14(2), 247\u2013259 (1996)","journal-title":"Games Econom. Behav."},{"key":"7_CR24","unstructured":"Liu, W., Jiang, H., Li, B., Li, H.: Equivalence analysis between counterfactual regret minimization and online mirror descent. arXiv preprint arXiv:2110.04961 (2021)"},{"key":"7_CR25","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of the 20th International Conference on Machine Learning (ICML-2003), pp. 928\u2013936 (2003)"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.tcs.2019.11.015","volume":"808","author":"P Joulani","year":"2020","unstructured":"Joulani, P., Gy\u00f6rgy, A., Szepesv\u00e1ri, C.: A modular analysis of adaptive (non-) convex optimization: optimism, composite objectives, variance reduction, and variational bounds. Theoret. Comput. Sci. 808, 108\u2013138 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Brown, N., Sandholm, T.: Strategy-based warm starting for regret minimization in games. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 30 (2016)","DOI":"10.1609\/aaai.v30i1.10056"},{"key":"7_CR28","unstructured":"Orabona, F.: A modern introduction to online learning. arXiv preprint arXiv:1912.13213 (2019)"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2022: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20862-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T23:29:54Z","timestamp":1667518194000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20862-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031208614","9783031208621"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20862-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"4 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shangai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pricai.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"432","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"91","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7-8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"n\/a","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}