{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T16:39:43Z","timestamp":1785170383535,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1563155, CCF-1703925, IIS-1838154, CCF-2106429, CCF-2107187"],"award-info":[{"award-number":["CCF-1563155, CCF-1703925, IIS-1838154, CCF-2106429, CCF-2107187"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,12]]},"DOI":"10.1145\/3490486.3538297","type":"proceedings-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T13:29:36Z","timestamp":1657718976000},"page":"1108-1118","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved Upper Bounds for Finding Tarski Fixed Points"],"prefix":"10.1145","author":[{"given":"Xi","family":"Chen","sequence":"first","affiliation":[{"name":"Columbia University, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuhao","family":"Li","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411511"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.052"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90048-K"},{"key":"e_1_3_2_1_5_1","volume-title":"11th Innovations in Theoretical Computer Science Conference, ITCS 2020","author":"Etessami Kousha","year":"2020","unstructured":"Kousha Etessami , Christos H. Papadimitriou , Aviad Rubinstein , and Mihalis Yannakakis . 2020 . Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria . In 11th Innovations in Theoretical Computer Science Conference, ITCS 2020 , January 12 --14 , 2020, Seattle, Washington, USA (LIPIcs, Vol. 151), Thomas Vidick (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 18:1--18:19. https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2020.18 10.4230\/LIPIcs.ITCS.2020.18 Kousha Etessami, Christos H. Papadimitriou, Aviad Rubinstein, and Mihalis Yannakakis. 2020. Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria. In 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12--14, 2020, Seattle, Washington, USA (LIPIcs, Vol. 151), Thomas Vidick (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 18:1--18:19. https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2020.18"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451052"},{"key":"e_1_3_2_1_7_1","volume-title":"A faster algorithm for finding Tarski fixed points. arXiv preprint arXiv:2010.02618","author":"Fearnley John","year":"2020","unstructured":"John Fearnley , D\u00f6m\u00f6t\u00f6r P\u00e1lv\u00f6lgyi , and Rahul Savani . 2020. A faster algorithm for finding Tarski fixed points. arXiv preprint arXiv:2010.02618 ( 2020 ). John Fearnley, D\u00f6m\u00f6t\u00f6r P\u00e1lv\u00f6lgyi, and Rahul Savani. 2020. A faster algorithm for finding Tarski fixed points. arXiv preprint arXiv:2010.02618 (2020)."},{"key":"e_1_3_2_1_8_1","volume-title":"Further Collapses in TFNP. arXiv preprint arXiv:2202.07761","author":"G\u00f6\u00f6s Mika","year":"2022","unstructured":"Mika G\u00f6\u00f6s , Alexandros Hollender , Siddhartha Jain , Gilbert Maystre , William Pires , Robert Robere , and Ran Tao . 2022. Further Collapses in TFNP. arXiv preprint arXiv:2202.07761 ( 2022 ). Mika G\u00f6\u00f6s, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, and Ran Tao. 2022. Further Collapses in TFNP. arXiv preprint arXiv:2202.07761 (2022)."},{"key":"e_1_3_2_1_9_1","volume-title":"learning, and equilibrium in games with strategic complementarities. Econometrica: Journal of the Econometric Society","author":"Milgrom Paul","year":"1990","unstructured":"Paul Milgrom and John Roberts . 1990. Rationalizability , learning, and equilibrium in games with strategic complementarities. Econometrica: Journal of the Econometric Society ( 1990 ), 1255--1277. Paul Milgrom and John Roberts. 1990. Rationalizability, learning, and equilibrium in games with strategic complementarities. Econometrica: Journal of the Econometric Society (1990), 1255--1277."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80063-7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1955.5.285"},{"key":"e_1_3_2_1_12_1","volume-title":"Equilibrium points in nonzero-sum n-person submodular games. Siam Journal on control and optimization","author":"Topkis Donald M","year":"1979","unstructured":"Donald M Topkis . 1979. Equilibrium points in nonzero-sum n-person submodular games. Siam Journal on control and optimization , Vol. 17 , 6 ( 1979 ), 773--787. Donald M Topkis. 1979. Equilibrium points in nonzero-sum n-person submodular games. Siam Journal on control and optimization, Vol. 17, 6 (1979), 773--787."},{"key":"e_1_3_2_1_13_1","unstructured":"Donald M Topkis. 1998. Supermodularity and Complementarity. Princeton University Press.  Donald M Topkis. 1998. Supermodularity and Complementarity. Princeton University Press."}],"event":{"name":"EC '22: The 23rd ACM Conference on Economics and Computation","location":"Boulder CO USA","acronym":"EC '22","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 23rd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538297","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538297","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538297","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:04Z","timestamp":1750188664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":12,"alternative-id":["10.1145\/3490486.3538297","10.1145\/3490486"],"URL":"https:\/\/doi.org\/10.1145\/3490486.3538297","relation":{},"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"2022-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}