{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:32Z","timestamp":1750219832504,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["IIS-1703846"],"award-info":[{"award-number":["IIS-1703846"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-17-1-0592","W911NF-19-1-0217"],"award-info":[{"award-number":["W911NF-17-1-0592","W911NF-19-1-0217"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,9]]},"DOI":"10.1145\/3580507.3597816","type":"proceedings-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:19:22Z","timestamp":1688739562000},"page":"853-884","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Chunking Tasks for Present-Biased Agents"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9229-1663","authenticated-orcid":false,"given":"Joseph Y.","family":"Halpern","sequence":"first","affiliation":[{"name":"Computer Science, Cornell University, Ithaca, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4466-8144","authenticated-orcid":false,"given":"Aditya","family":"Saraf","sequence":"additional","affiliation":[{"name":"Computer Science, Cornell University, Ithaca, NY, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Procrastination and obedience. The american economic review 81, 2","author":"Akerlof George A","year":"1991","unstructured":"George A Akerlof . 1991. Procrastination and obedience. The american economic review 81, 2 ( 1991 ), 1--19. George A Akerlof. 1991. Procrastination and obedience. The american economic review 81, 2 (1991), 1--19."},{"key":"e_1_3_2_1_2_1","volume-title":"On the value of penalties in time-inconsistent planning. arXiv preprint arXiv:1702.01677","author":"Albers Susanne","year":"2017","unstructured":"Susanne Albers and Dennis Kraft . 2017. On the value of penalties in time-inconsistent planning. arXiv preprint arXiv:1702.01677 ( 2017 ). Susanne Albers and Dennis Kraft. 2017. On the value of penalties in time-inconsistent planning. arXiv preprint arXiv:1702.01677 (2017)."},{"key":"e_1_3_2_1_3_1","volume-title":"Motivating time-inconsistent agents: A computational approach. Theory of computing systems 63, 3","author":"Albers Susanne","year":"2019","unstructured":"Susanne Albers and Dennis Kraft . 2019. Motivating time-inconsistent agents: A computational approach. Theory of computing systems 63, 3 ( 2019 ), 466--487. Susanne Albers and Dennis Kraft. 2019. Motivating time-inconsistent agents: A computational approach. Theory of computing systems 63, 3 (2019), 466--487."},{"key":"e_1_3_2_1_4_1","volume-title":"Collaborative Procrastination. In 10th International Conference on Fun with Algorithms (FUN","author":"Anagnostopoulos Aris","year":"2020","unstructured":"Aris Anagnostopoulos , Aristides Gionis , and Nikos Parotsidis . 2020 . Collaborative Procrastination. In 10th International Conference on Fun with Algorithms (FUN 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. Aris Anagnostopoulos, Aristides Gionis, and Nikos Parotsidis. 2020. Collaborative Procrastination. In 10th International Conference on Fun with Algorithms (FUN 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_5_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms , Third Edition (3 rd ed.). The MIT Press . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, Third Edition (3rd ed.). The MIT Press.","edition":"3"},{"key":"e_1_3_2_1_6_1","volume-title":"Inconsistent Planning: When in doubt, toss a coin! arXiv preprint arXiv:2112.03329","author":"Dementiev Yuriy","year":"2021","unstructured":"Yuriy Dementiev , Fedor V Fomin , and Artur Ignatiev . 2021 . Inconsistent Planning: When in doubt, toss a coin! arXiv preprint arXiv:2112.03329 (2021). Yuriy Dementiev, Fedor V Fomin, and Artur Ignatiev. 2021. Inconsistent Planning: When in doubt, toss a coin! arXiv preprint arXiv:2112.03329 (2021)."},{"key":"e_1_3_2_1_7_1","volume-title":"Present-Biased Optimization. arXiv preprint arXiv:2012.14736","author":"Fomin Fedor V","year":"2020","unstructured":"Fedor V Fomin , Pierre Fraigniaud , and Petr A Golovach . 2020. Present-Biased Optimization. arXiv preprint arXiv:2012.14736 ( 2020 ). Fedor V Fomin, Pierre Fraigniaud, and Petr A Golovach. 2020. Present-Biased Optimization. arXiv preprint arXiv:2012.14736 (2020)."},{"key":"e_1_3_2_1_8_1","volume-title":"Procrastination with variable present bias. arXiv preprint arXiv:1606.03062","author":"Gravin Nick","year":"2016","unstructured":"Nick Gravin , Nicole Immorlica , Brendan Lucier , and Emmanouil Pountourakis . 2016. Procrastination with variable present bias. arXiv preprint arXiv:1606.03062 ( 2016 ). Nick Gravin, Nicole Immorlica, Brendan Lucier, and Emmanouil Pountourakis. 2016. Procrastination with variable present bias. arXiv preprint arXiv:1606.03062 (2016)."},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the fifteenth ACM conference on Economics and computation. 547--564","author":"Kleinberg Jon","year":"2014","unstructured":"Jon Kleinberg and Sigal Oren . 2014 . Time-inconsistent planning: a computational problem in behavioral economics . In Proceedings of the fifteenth ACM conference on Economics and computation. 547--564 . Jon Kleinberg and Sigal Oren. 2014. Time-inconsistent planning: a computational problem in behavioral economics. In Proceedings of the fifteenth ACM conference on Economics and computation. 547--564."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 2016 ACM Conference on Economics and Computation. 343--360","author":"Kleinberg Jon","year":"2016","unstructured":"Jon Kleinberg , Sigal Oren , and Manish Raghavan . 2016 . Planning problems for sophisticated agents with present bias . In Proceedings of the 2016 ACM Conference on Economics and Computation. 343--360 . Jon Kleinberg, Sigal Oren, and Manish Raghavan. 2016. Planning problems for sophisticated agents with present bias. In Proceedings of the 2016 ACM Conference on Economics and Computation. 343--360."},{"key":"e_1_3_2_1_11_1","volume-title":"Penalty Bidding Mechanisms for Allocating Resources and Overcoming Present Bias. arXiv preprint arXiv:1906.09713","author":"Ma Hongyao","year":"2019","unstructured":"Hongyao Ma , Reshef Meir , David C Parkes , and Elena Wu-Yan . 2019. Penalty Bidding Mechanisms for Allocating Resources and Overcoming Present Bias. arXiv preprint arXiv:1906.09713 ( 2019 ). Hongyao Ma, Reshef Meir, David C Parkes, and Elena Wu-Yan. 2019. Penalty Bidding Mechanisms for Allocating Resources and Overcoming Present Bias. arXiv preprint arXiv:1906.09713 (2019)."},{"key":"e_1_3_2_1_12_1","volume-title":"Principal-Agent Problems with Present-Biased Agents. In International Symposium on Algorithmic Game Theory. Springer, 237--251","author":"Oren Sigal","year":"2019","unstructured":"Sigal Oren and Dolav Soker . 2019 . Principal-Agent Problems with Present-Biased Agents. In International Symposium on Algorithmic Game Theory. Springer, 237--251 . Sigal Oren and Dolav Soker. 2019. Principal-Agent Problems with Present-Biased Agents. In International Symposium on Algorithmic Game Theory. Springer, 237--251."},{"key":"e_1_3_2_1_13_1","unstructured":"Tim Roughgarden. 2016. CS269I: Incentives in Computer Science Lecture#19: Time-Inconsistent Planning. (2016).  Tim Roughgarden. 2016. CS269I: Incentives in Computer Science Lecture#19: Time-Inconsistent Planning. (2016)."},{"key":"e_1_3_2_1_14_1","volume-title":"Competition Alleviates Present Bias in Task Completion. In International Conference on Web and Internet Economics. Springer, 266--279","author":"Saraf Aditya","year":"2020","unstructured":"Aditya Saraf , Anna R Karlin , and Jamie Morgenstern . 2020 . Competition Alleviates Present Bias in Task Completion. In International Conference on Web and Internet Economics. Springer, 266--279 . Aditya Saraf, Anna R Karlin, and Jamie Morgenstern. 2020. Competition Alleviates Present Bias in Task Completion. In International Conference on Web and Internet Economics. Springer, 266--279."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3298023.3298100"}],"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.3597816","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580507.3597816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:35Z","timestamp":1750178795000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597816"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":15,"alternative-id":["10.1145\/3580507.3597816","10.1145\/3580507"],"URL":"https:\/\/doi.org\/10.1145\/3580507.3597816","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"}}]}}