{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:17:23Z","timestamp":1760300243964,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316354","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:19:08Z","timestamp":1561033148000},"page":"650-661","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["The communication complexity of local search"],"prefix":"10.1145","author":[{"given":"Yakov","family":"Babichenko","sequence":"first","affiliation":[{"name":"Technion, Israel"}]},{"given":"Shahar","family":"Dobzinski","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Israel"}]},{"given":"Noam","family":"Nisan","sequence":"additional","affiliation":[{"name":"Hebrew University of Jerusalem, Israel"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704447237"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993605"},{"key":"e_1_3_2_1_3_1","unstructured":"A. Anshu N. B. Goud R. Jain S. Kundu and P. Mukhopadhyay. Lifting randomized query complexity to randomized communication complexity. arXiv preprint arXiv:1703.07521 2017.  A. Anshu N. B. Goud R. Jain S. Kundu and P. Mukhopadhyay. Lifting randomized query complexity to randomized communication complexity. arXiv preprint arXiv:1703.07521 2017."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"M. Babaioff S. Dobzinski and S. Oren. Combiantorial auctions with endowment effect. 2018.  M. Babaioff S. Dobzinski and S. Oren. Combiantorial auctions with endowment effect. 2018.","DOI":"10.1145\/3219166.3219197"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Y. Babichenko and A. Rubinstein. Communication complexity of approximate Nash equilibria. arXiv preprint arXiv:1608.06580 2016.  Y. Babichenko and A. Rubinstein. Communication complexity of approximate Nash equilibria. arXiv preprint arXiv:1608.06580 2016.","DOI":"10.1145\/3055399.3055407"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1575"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_67"},{"first-page":"24","volume-title":"Proceedings of the twenty-first international conference on Machine learning","author":"Conitzer V.","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/070699652"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591838"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00045"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.70"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"M. G\u00f6\u00f6s T. Pitassi and T. Watson. Query-to-communication lifting for BPP. arXiv preprint arXiv:1703.07666 2017.  M. G\u00f6\u00f6s T. Pitassi and T. Watson. Query-to-communication lifting for BPP. arXiv preprint arXiv:1703.07666 2017.","DOI":"10.1109\/FOCS.2017.21"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2007.12.002"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1257\/000282803322655581"},{"key":"e_1_3_2_1_16_1","volume-title":"LIPIcs-Leibniz International Proceedings in Informatics","volume":"67","author":"Hub\u00e1cek P.","year":"2017"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90046-3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0403021"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206317"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90200-L"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"},{"key":"e_1_3_2_1_22_1","unstructured":"N. Nisan. The communication complexity of threshold gates. Combinatorics Paul Erdos is Eighty 1:301\u2013315 1993.  N. Nisan. The communication complexity of threshold gates. Combinatorics Paul Erdos is Eighty 1:301\u2013315 1993."},{"volume-title":"Turing\u2019s Invisible Hand blog, https:\/\/agtb.wordpress.com\/2009\/08\/18\/communication-complexityof-reaching-equilibrium","year":"2009","author":"Nisan N.","key":"e_1_3_2_1_23_1"},{"volume-title":"Turing\u2019s Invisible Hand blog, https:\/\/agtb.wordpress.com\/2009\/11\/19\/the-computationalcomplexity-of-pure-nash","year":"2009","author":"Nisan N.","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2004.10.007"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100274"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796321"},{"key":"e_1_3_2_1_28_1","unstructured":"STOC \u201919 June 23\u201326 2019 Phoenix AZ USA Yakov Babichenko Shahar Dobzinski and Noam Nisan  STOC \u201919 June 23\u201326 2019 Phoenix AZ USA Yakov Babichenko Shahar Dobzinski and Noam Nisan"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007427"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9170-6"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-3078-3"}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Phoenix AZ USA","acronym":"STOC '19"},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316354","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316354","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:32Z","timestamp":1750204472000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":31,"alternative-id":["10.1145\/3313276.3316354","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316354","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}