{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:17:51Z","timestamp":1750220271104,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Center for Emerging Risk Research"},{"name":"Cooperative AI Foundation"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1814056, CCF-2122628"],"award-info":[{"award-number":["IIS-1814056, CCF-2122628"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF2110230"],"award-info":[{"award-number":["W911NF2110230"]}],"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":[[2022,7,12]]},"DOI":"10.1145\/3490486.3538280","type":"proceedings-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T13:29:36Z","timestamp":1657718976000},"page":"1121-1140","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Algorithms for Planning with Participation Constraints"],"prefix":"10.1145","author":[{"given":"Hanrui","family":"Zhang","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Yu","family":"Cheng","sequence":"additional","affiliation":[{"name":"University of Illinois at Chicago, Chicago, IL, USA"}]},{"given":"Vincent","family":"Conitzer","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Constrained Markov decision processes with total cost criteria: Occupation measures and primal LP. Mathematical methods of operations research","author":"Altman Eitan","year":"1996","unstructured":"Eitan Altman . 1996. Constrained Markov decision processes with total cost criteria: Occupation measures and primal LP. Mathematical methods of operations research , Vol. 43 , 1 ( 1996 ), 45--72. Eitan Altman. 1996. Constrained Markov decision processes with total cost criteria: Occupation measures and primal LP. Mathematical methods of operations research, Vol. 43, 1 (1996), 45--72."},{"key":"e_1_3_2_1_2_1","volume-title":"Constrained Markov decision processes with total cost criteria: Lagrangian approach and dual linear program. Mathematical methods of operations research","author":"Altman Eitan","year":"1998","unstructured":"Eitan Altman . 1998. Constrained Markov decision processes with total cost criteria: Lagrangian approach and dual linear program. Mathematical methods of operations research , Vol. 48 , 3 ( 1998 ), 387--417. Eitan Altman. 1998. Constrained Markov decision processes with total cost criteria: Lagrangian approach and dual linear program. Mathematical methods of operations research, Vol. 48, 3 (1998), 387--417."},{"volume-title":"Constrained Markov decision processes","author":"Altman Eitan","key":"e_1_3_2_1_3_1","unstructured":"Eitan Altman . 1999. Constrained Markov decision processes . Vol. 7 . CRC Press . Eitan Altman. 1999. Constrained Markov decision processes. Vol. 7. CRC Press."},{"key":"e_1_3_2_1_4_1","first-page":"169","article-title":"The linear program approach in multi-chain Markov decision processes revisited","volume":"42","author":"Altman Eitan","year":"1995","unstructured":"Eitan Altman and Flos Spieksma . 1995 . The linear program approach in multi-chain Markov decision processes revisited . Zeitschrift f\u00fcr Operations Research , Vol. 42 , 2 (1995), 169 -- 188 . Eitan Altman and Flos Spieksma. 1995. The linear program approach in multi-chain Markov decision processes revisited. Zeitschrift f\u00fcr Operations Research, Vol. 42, 2 (1995), 169--188.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA6995"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA7260"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1257\/jel.20180892"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1086\/704387"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622519.1622521"},{"key":"e_1_3_2_1_10_1","volume-title":"Twenty-Third International Joint Conference on Artificial Intelligence .","author":"Hoang Trong Nghia","year":"2013","unstructured":"Trong Nghia Hoang and Kian Hsiang Low . 2013 . Interactive POMDP Lite: Towards practical planning to predict and exploit intentions for interacting with self-interested agents . In Twenty-Third International Joint Conference on Artificial Intelligence . Trong Nghia Hoang and Kian Hsiang Low. 2013. Interactive POMDP Lite: Towards practical planning to predict and exploit intentions for interacting with self-interested agents. In Twenty-Third International Joint Conference on Artificial Intelligence ."},{"key":"e_1_3_2_1_11_1","volume-title":"Trends and applications in Stackelberg security games. Handbook of dynamic game theory","author":"Kar Debarun","year":"2017","unstructured":"Debarun Kar , Thanh H Nguyen , Fei Fang , Matthew Brown , Arunesh Sinha , Milind Tambe , and Albert Xin Jiang . 2017. Trends and applications in Stackelberg security games. Handbook of dynamic game theory ( 2017 ), 1--47. Debarun Kar, Thanh H Nguyen, Fei Fang, Matthew Brown, Arunesh Sinha, Milind Tambe, and Albert Xin Jiang. 2017. Trends and applications in Stackelberg security games. Handbook of dynamic game theory (2017), 1--47."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347480"},{"volume-title":"Reinforcement Learning","author":"Oliehoek Frans A","key":"e_1_3_2_1_13_1","unstructured":"Frans A Oliehoek . 2012. Decentralized POMDPs . In Reinforcement Learning . Springer , 471--503. Frans A Oliehoek. 2012. Decentralized POMDPs. In Reinforcement Learning. Springer, 471--503."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch100"},{"key":"e_1_3_2_1_15_1","volume-title":"The complexity of Markov decision processes. Mathematics of operations research","author":"Papadimitriou Christos H","year":"1987","unstructured":"Christos H Papadimitriou and John N Tsitsiklis . 1987. The complexity of Markov decision processes. Mathematics of operations research , Vol. 12 , 3 ( 1987 ), 441--450. Christos H Papadimitriou and John N Tsitsiklis. 1987. The complexity of Markov decision processes. Mathematics of operations research, Vol. 12, 3 (1987), 441--450."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108227162.001"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA10269"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2078"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2591248.2591251"},{"key":"e_1_3_2_1_20_1","unstructured":"David Silver and Joel Veness. 2010. Monte-Carlo planning in large POMDPs. Neural Information Processing Systems.  David Silver and Joel Veness. 2010. Monte-Carlo planning in large POMDPs. Neural Information Processing Systems."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Arunesh Sinha Fei Fang Bo An Christopher Kiekintveld and Milind Tambe. 2018. Stackelberg security games: Looking beyond a decade of success. IJCAI.  Arunesh Sinha Fei Fang Bo An Christopher Kiekintveld and Milind Tambe. 2018. Stackelberg security games: Looking beyond a decade of success. IJCAI.","DOI":"10.24963\/ijcai.2018\/775"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1257\/mic.20170405"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/3176764.3176770"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i5.20462"},{"key":"e_1_3_2_1_25_1","volume-title":"Advances in Neural Information Processing Systems","volume":"34","author":"Zhang Hanrui","year":"2021","unstructured":"Hanrui Zhang and Vincent Conitzer . 2021 . Automated Dynamic Mechanism Design . Advances in Neural Information Processing Systems , Vol. 34 (2021). Hanrui Zhang and Vincent Conitzer. 2021. Automated Dynamic Mechanism Design. Advances in Neural Information Processing Systems, Vol. 34 (2021)."}],"event":{"name":"EC '22: The 23rd ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Boulder CO USA","acronym":"EC '22"},"container-title":["Proceedings of the 23rd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538280","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538280","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538280","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.3538280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":25,"alternative-id":["10.1145\/3490486.3538280","10.1145\/3490486"],"URL":"https:\/\/doi.org\/10.1145\/3490486.3538280","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"}}]}}