{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:40Z","timestamp":1750219780740,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Cooperative AI Foundation"},{"name":"Polaris Ventures"},{"name":"Jaan Tallinn's donor-advised fund at Founders Pledge"},{"name":"National Science Foundation","award":["CCF-2307106"],"award-info":[{"award-number":["CCF-2307106"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,9]]},"DOI":"10.1145\/3580507.3597665","type":"proceedings-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:19:22Z","timestamp":1688739562000},"page":"1161-1186","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficiently Solving Turn-Taking Stochastic Games with Extensive-Form Correlation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8991-0622","authenticated-orcid":false,"given":"Hanrui","family":"Zhang","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, Pennsylvania, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0019-2570","authenticated-orcid":false,"given":"Yu","family":"Cheng","sequence":"additional","affiliation":[{"name":"Brown University, Providence, Rhode Island, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1899-7884","authenticated-orcid":false,"given":"Vincent","family":"Conitzer","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, Pennsylvania, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133242"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2307\/1967631"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10045"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516516"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v25i1.7875"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134717"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2008.02.015"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/070699652"},{"key":"e_1_3_2_1_9_1","volume-title":"Fei Fang, and Tuomas Sandholm.","author":"Farina Gabriele","year":"2019","unstructured":"Gabriele Farina , Chun Kai Ling , Fei Fang, and Tuomas Sandholm. 2019 . Correlation in extensive-form games: Saddle-point formulation and benchmarks. Advances in Neural Information Processing Systems 32 (2019). Gabriele Farina, Chun Kai Ling, Fei Fang, and Tuomas Sandholm. 2019. Correlation in extensive-form games: Saddle-point formulation and benchmarks. Advances in Neural Information Processing Systems 32 (2019)."},{"key":"e_1_3_2_1_10_1","first-page":"19609","article-title":"Polynomial-time computation of optimal correlated equilibria in two-player extensive-form games with public chance moves and beyond","volume":"33","author":"Farina Gabriele","year":"2020","unstructured":"Gabriele Farina and Tuomas Sandholm . 2020 . Polynomial-time computation of optimal correlated equilibria in two-player extensive-form games with public chance moves and beyond . Advances in Neural Information Processing Systems 33 (2020), 19609 -- 19619 . Gabriele Farina and Tuomas Sandholm. 2020. Polynomial-time computation of optimal correlated equilibria in two-player extensive-form games with public chance moves and beyond. Advances in Neural Information Processing Systems 33 (2020), 19609--19619.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0899-8256(89)90006-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_56"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807354"},{"key":"e_1_3_2_1_14_1","volume-title":"Twenty-Sixth AAAI Conference on Artificial Intelligence.","author":"Letchford Joshua","year":"2012","unstructured":"Joshua Letchford , Liam MacDermed , Vincent Conitzer , Ronald Parr , and Charles L Isbell . 2012 . Computing optimal strategies to commit to in stochastic games . In Twenty-Sixth AAAI Conference on Artificial Intelligence. Joshua Letchford, Liam MacDermed, Vincent Conitzer, Ronald Parr, and Charles L Isbell. 2012. Computing optimal strategies to commit to in stochastic games. In Twenty-Sixth AAAI Conference on Artificial Intelligence."},{"key":"e_1_3_2_1_15_1","volume-title":"The complexity of finding Nash equilibria. Algorithmic game theory 2","author":"Papadimitriou Christos H","year":"2007","unstructured":"Christos H Papadimitriou . 2007. The complexity of finding Nash equilibria. Algorithmic game theory 2 ( 2007 ), 30. Christos H Papadimitriou. 2007. The complexity of finding Nash equilibria. Algorithmic game theory 2 (2007), 30."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1080.0340"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2009.11.008"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538330"},{"key":"e_1_3_2_1_19_1","unstructured":"Brian Hu Zhang and Tuomas Sandholm. 2022. Polynomial-Time Optimal Equilibria with a Mediator in Extensive-Form Games. In Advances in Neural Information Processing Systems.  Brian Hu Zhang and Tuomas Sandholm. 2022. Polynomial-Time Optimal Equilibria with a Mediator in Extensive-Form Games. In Advances in Neural Information Processing Systems."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538280"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i5.20462"}],"event":{"name":"EC '23: 24th ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"London United Kingdom","acronym":"EC '23"},"container-title":["Proceedings of the 24th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597665","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580507.3597665","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:42Z","timestamp":1750178262000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597665"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":21,"alternative-id":["10.1145\/3580507.3597665","10.1145\/3580507"],"URL":"https:\/\/doi.org\/10.1145\/3580507.3597665","relation":{},"subject":[],"published":{"date-parts":[[2023,7,7]]},"assertion":[{"value":"2023-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}