{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:40:07Z","timestamp":1750192807327,"version":"3.41.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T00:00:00Z","timestamp":1656288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["IIS-1703846 and No. IIS-1718108"],"award-info":[{"award-number":["IIS-1703846 and No. IIS-1718108"]}]},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"crossref","award":["FA9550-12-1-0040"],"award-info":[{"award-number":["FA9550-12-1-0040"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"name":"ARO","award":["W911NF-17-1-0592"],"award-info":[{"award-number":["W911NF-17-1-0592"]}]},{"DOI":"10.13039\/100014895","name":"Open Philanthropy project","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100014895","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2022,6,30]]},"abstract":"<jats:p>\n            We introduce a theoretical model of information acquisition under resource limitations in a noisy environment. An agent must guess the truth value of a given Boolean formula\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\( \\varphi \\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            after performing a bounded number of noisy tests of the truth values of variables in the formula. We observe that, in general, the problem of finding an optimal testing strategy for\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\( \\varphi \\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            is hard, but we suggest a useful heuristic. The techniques we use also give insight into two apparently unrelated but well-studied problems: (1)\n            <jats:italic>rational inattention<\/jats:italic>\n            , that is, when it is rational to ignore pertinent information (the optimal strategy may involve hardly ever testing variables that are clearly relevant to\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\( \\varphi \\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            ), and (2) what makes a formula hard to learn\/remember.\n          <\/jats:p>","DOI":"10.1145\/3510024","type":"journal-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T21:57:36Z","timestamp":1645653456000},"page":"1-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Information Acquisition Under Resource Limitations in a Noisy Environment"],"prefix":"10.1145","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2376-4076","authenticated-orcid":false,"given":"Matvey","family":"Soloviev","sequence":"first","affiliation":[{"name":"Computer Science Department, Cornell University, Ithaca, NY, USA"}]},{"given":"Joseph Y.","family":"Halpern","sequence":"additional","affiliation":[{"name":"Computer Science Department, Cornell University, Ithaca, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,6,27]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_3_2_2","DOI":"10.1287\/moor.11.1.180"},{"key":"e_1_3_3_3_2","first-page":"60","volume-title":"Proceedings of the AAAI Fall Symposium Series on Relevance","author":"Druzdzel M. J.","year":"1994","unstructured":"M. J. Druzdzel and H. J. Suermondt. 1994. Relevance in probabilistic models: \u201cBackyards\u201d in a \u201csmall world.\u201d In Proceedings of the AAAI Fall Symposium Series on Relevance. 60\u201363."},{"doi-asserted-by":"publisher","key":"e_1_3_3_4_2","DOI":"10.1016\/j.jmp.2006.03.002"},{"doi-asserted-by":"publisher","key":"e_1_3_3_5_2","DOI":"10.1145\/800057.808695"},{"doi-asserted-by":"publisher","key":"e_1_3_3_6_2","DOI":"10.1613\/jair.1113"},{"doi-asserted-by":"publisher","key":"e_1_3_3_7_2","DOI":"10.1002\/j.1538-7305.1959.tb01585.x"},{"doi-asserted-by":"publisher","key":"e_1_3_3_8_2","DOI":"10.1037\/0033-295X.111.2.309"},{"doi-asserted-by":"publisher","key":"e_1_3_3_9_2","DOI":"10.1016\/j.ipl.2006.08.012"},{"doi-asserted-by":"publisher","key":"e_1_3_3_10_2","DOI":"10.1037\/h0093825"},{"doi-asserted-by":"publisher","key":"e_1_3_3_11_2","DOI":"10.1016\/S0304-3932(03)00029-1"},{"doi-asserted-by":"publisher","key":"e_1_3_3_12_2","DOI":"10.5555\/646229.681550"},{"key":"e_1_3_3_13_2","first-page":"774","article-title":"Recognition of patterns using generalized portraits","volume":"24","author":"Vapnik V. N.","year":"1963","unstructured":"V. N. Vapnik and A. Y. Lerner. 1963. Recognition of patterns using generalized portraits. Avtomat. i Telemekh. 24, 6 (1963), 774\u2013780.","journal-title":"Avtomat. i Telemekh."},{"doi-asserted-by":"publisher","key":"e_1_3_3_14_2","DOI":"10.1016\/j.ins.2011.05.020"},{"key":"e_1_3_3_15_2","volume-title":"The New Palgrave Dictionary of Economics","author":"Wiederholt M.","year":"2010","unstructured":"M. Wiederholt. 2010. Rational inattention. In The New Palgrave Dictionary of Economics, L. E. Blume and S. Durlauf (Eds.). Palgrave Macmillan, New York."}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510024","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3510024","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3510024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:24Z","timestamp":1750191144000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,27]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6,30]]}},"alternative-id":["10.1145\/3510024"],"URL":"https:\/\/doi.org\/10.1145\/3510024","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"type":"print","value":"0004-5411"},{"type":"electronic","value":"1557-735X"}],"subject":[],"published":{"date-parts":[[2022,6,27]]},"assertion":[{"value":"2019-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}