{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T20:02:43Z","timestamp":1772654563766,"version":"3.50.1"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2016,12,8]],"date-time":"2016-12-08T00:00:00Z","timestamp":1481155200000},"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":["AI Matters"],"published-print":{"date-parts":[[2016,12,8]]},"abstract":"<jats:p>\n            Decision making is hard. It often requires reasoning about uncertain environments, partial observability and action spaces that are too large to enumerate. In such tasks decision-theoretic agents can often assist us. In most research on decision-theoretic agents, the desirability of actions and their effects is codified in a scalar reward function. However, many real-world decision problems have multiple objectives. In such cases the problem is more naturally expressed using a vector-valued reward function, leading to a\n            <jats:italic>multi-objective decision problem (MODP).<\/jats:italic>\n          <\/jats:p>","DOI":"10.1145\/3008665.3008670","type":"journal-article","created":{"date-parts":[[2016,12,9]],"date-time":"2016-12-09T17:26:14Z","timestamp":1481304374000},"page":"11-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Multi-objective decision-theoretic planning"],"prefix":"10.1145","volume":"2","author":[{"given":"Diederik M.","family":"Roijers","sequence":"first","affiliation":[{"name":"University of Oxford"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"NIPS.","author":"Guestrin C.","year":"2002"},{"key":"e_1_2_1_2_1","volume-title":"ICML (pp. 849--856).","author":"Liu Q.","year":"2011"},{"key":"e_1_2_1_3_1","unstructured":"Mateescu R. & Dechter R. (2005). The relationship between AND\/OR search and variable elimination. UAI (pp. 380--387).   Mateescu R. & Dechter R. (2005). The relationship between AND\/OR search and variable elimination. UAI (pp. 380--387)."},{"key":"e_1_2_1_4_1","volume-title":"ICAPS (pp. 262--270).","author":"Roijers D.","year":"2014"},{"key":"e_1_2_1_5_1","volume-title":"Malic.","author":"Roijers D. M.","year":"2015"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2831407.2831416"},{"key":"e_1_2_1_7_1","volume-title":"IJCAI.","author":"Roijers D. M.","year":"2015"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Spaan M. T. J. & Vlassis N. (2005). Perseus: Randomized point-based value iteration for POMDPs. JAIR 195--220.   Spaan M. T. J. & Vlassis N. (2005). Perseus: Randomized point-based value iteration for POMDPs. JAIR 195--220.","DOI":"10.1613\/jair.1659"}],"container-title":["AI Matters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3008665.3008670","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3008665.3008670","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:21Z","timestamp":1750217781000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3008665.3008670"}},"subtitle":["abstract"],"short-title":[],"issued":{"date-parts":[[2016,12,8]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,12,8]]}},"alternative-id":["10.1145\/3008665.3008670"],"URL":"https:\/\/doi.org\/10.1145\/3008665.3008670","relation":{},"ISSN":["2372-3483"],"issn-type":[{"value":"2372-3483","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,8]]},"assertion":[{"value":"2016-12-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}