{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T17:53:24Z","timestamp":1777398804343,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2327010"],"award-info":[{"award-number":["CCF-2327010"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,8]]},"DOI":"10.1145\/3670865.3673462","type":"proceedings-article","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T20:13:33Z","timestamp":1734466413000},"page":"782-805","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Improved Mechanisms and Prophet Inequalities for Graphical Dependencies"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3425-0409","authenticated-orcid":false,"given":"Vasilis","family":"Livanos","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering, University of Chile, Santiago, Chile"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0807-1634","authenticated-orcid":false,"given":"Kalen","family":"Patton","sequence":"additional","affiliation":[{"name":"School of Math, Georgia Institute of Technology, Atlanta, Georgia, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8800-6479","authenticated-orcid":false,"given":"Sahil","family":"Singla","sequence":"additional","affiliation":[{"name":"School of Computer Science, Georgia Institute of Technology, Atlanta, Georgia, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2024,12,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3398745"},{"key":"e_1_3_2_1_2_1","first-page":"95","article-title":"Revenue Maximization for Selling Multiple Correlated Items","volume":"2015","author":"Bateni MohammadHossein","year":"2015","unstructured":"MohammadHossein Bateni, Sina Dehghani, Mohammad Taghi Hajiaghayi, and Saeed Seddighin. 2015. Revenue Maximization for Selling Multiple Correlated Items. In Algorithms - ESA 2015. 95--105.","journal-title":"Algorithms - ESA"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467643"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Ioannis Caragiannis Nick Gravin Pinyan Lu and Zihe Wang. 2022. Relaxing the Independence Assumption in Sequential Posted Pricing Prophet Inequality and Random Bipartite Matching. In Web and Internet Economics. 131--148.","DOI":"10.1007\/978-3-030-94676-0_8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250946"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807366"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331033.3331039"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.96"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649718"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0493-0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1226130"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(81)90017-X"},{"key":"e_1_3_2_1_13_1","volume-title":"The Implementation of Social Choice Rules: Some General Results on Incentive Compatibility. Review of Economic Studies 46 (04","author":"Hammond Peter","year":"1979","unstructured":"Peter Hammond, Partha Dasgupta, and Eric S Maskin. 1979. The Implementation of Social Choice Rules: Some General Results on Incentive Compatibility. Review of Economic Studies 46 (04 1979), 185--216."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2019.07.006"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.3982\/TE1517"},{"key":"e_1_3_2_1_16_1","volume-title":"Mechanism design and approximation. Book draft. October 122, 1","author":"Hartline Jason D","year":"2013","unstructured":"Jason D Hartline. 2013. Mechanism design and approximation. Book draft. October 122, 1 (2013)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/125\/1160620"},{"key":"e_1_3_2_1_18_1","volume-title":"Prophet Inequalities with Linear Correlations and Augmentations (EC '20)","author":"Immorlica Nicole","year":"2020","unstructured":"Nicole Immorlica, Sahil Singla, and Bo Waggoner. 2020. Prophet Inequalities with Linear Correlations and Augmentations (EC '20). 159--185."},{"key":"e_1_3_2_1_19_1","volume-title":"Bayesian networks and decision graphs","author":"Jensen Finn V","unstructured":"Finn V Jensen and Thomas Dyhre Nielsen. 2007. Bayesian networks and decision graphs. Vol. 2. Springer."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"R. Kleinberg and S. M. Weinberg. 2012. Matroid prophet inequalities. (2012) 123--136.","DOI":"10.1145\/2213977.2213991"},{"key":"e_1_3_2_1_21_1","volume-title":"Probabilistic graphical models: principles and techniques","author":"Koller Daphne","unstructured":"Daphne Koller and Nir Friedman. 2009. Probabilistic graphical models: principles and techniques. MIT press."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3144722.3144725"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2005.08.007"},{"key":"e_1_3_2_1_24_1","unstructured":"Judea Pearl. 2009. Causality. Cambridge University Press."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Amir Ronen. 2001. On approximating optimal auctions (EC '01). 11--17.","DOI":"10.1145\/501158.501160"},{"key":"e_1_3_2_1_26_1","volume-title":"Twenty lectures on algorithmic game theory","author":"Roughgarden Tim","unstructured":"Tim Roughgarden. 2016. Twenty lectures on algorithmic game theory. Cambridge University Press."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3105448"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993150"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2003.09.002"}],"event":{"name":"EC '24: 25th ACM Conference on Economics and Computation","location":"New Haven CT USA","acronym":"EC '24","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 25th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673462","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673462","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:05:42Z","timestamp":1750291542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":29,"alternative-id":["10.1145\/3670865.3673462","10.1145\/3670865"],"URL":"https:\/\/doi.org\/10.1145\/3670865.3673462","relation":{},"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"2024-12-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}