{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T04:35:50Z","timestamp":1688790950818},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,9]]},"DOI":"10.1145\/3580507.3597741","type":"proceedings-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:19:22Z","timestamp":1688739562000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Prophet Inequalities over Time"],"prefix":"10.1145","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-5997-6636","authenticated-orcid":false,"given":"Andreas","family":"Abels","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-8195-8226","authenticated-orcid":false,"given":"Elias","family":"Pitschmann","sequence":"additional","affiliation":[{"name":"University of Bremen, Bremen, Germany"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-7776-3426","authenticated-orcid":false,"given":"Daniel","family":"Schmand","sequence":"additional","affiliation":[{"name":"University of Bremen, Bremen, Germany"}]}],"member":"320","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"A. Abels E. Pitschmann and D. Schmand. 2022. Prophet Inequalities over Time. (2022). arXiv:2211.10471 A. Abels E. Pitschmann and D. Schmand. 2022. Prophet Inequalities over Time. (2022). arXiv:2211.10471"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the 42nd Symposium on Theory of Computing. 311--320","author":"Chawla S.","unstructured":"S. Chawla , J. Hartline , D. Malec , and B. Sivan . 2010. Multi-parameter mechanism design and sequential posted pricing . In Proceedings of the 42nd Symposium on Theory of Computing. 311--320 . S. Chawla, J. Hartline, D. Malec, and B. Sivan. 2010. Multi-parameter mechanism design and sequential posted pricing. In Proceedings of the 42nd Symposium on Theory of Computing. 311--320."},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the 55th Symposium on Theory of Computing.","author":"Correa J.","unstructured":"J. Correa and A. Cristi . 2023. A Constant Factor Prophet Inequality for Online Combinatorial Auctions . In Proceedings of the 55th Symposium on Theory of Computing. to appear. J. Correa and A. Cristi. 2023. A Constant Factor Prophet Inequality for Online Combinatorial Auctions. In Proceedings of the 55th Symposium on Theory of Computing. to appear."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"J. Correa A. Cristi B. Epstein and J. Soto. 2023. Sample-driven optimal stopping: From the secretary problem to the i.i.d. prophet inequality. Mathematics of Operations Research 0 0 (2023). J. Correa A. Cristi B. Epstein and J. Soto. 2023. Sample-driven optimal stopping: From the secretary problem to the i.i.d. prophet inequality. Mathematics of Operations Research 0 0 (2023).","DOI":"10.1287\/moor.2023.1363"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 2017 ACM Conference on Economics and Computation. 169--186","author":"Correa J.","unstructured":"J. Correa , P. Foncea , R. Hoeksma , T. Oosterwijk , and T. Vredeveld . 2017. Posted Price Mechanisms for a Random Stream of Customers . In Proceedings of the 2017 ACM Conference on Economics and Computation. 169--186 . J. Correa, P. Foncea, R. Hoeksma, T. Oosterwijk, and T. Vredeveld. 2017. Posted Price Mechanisms for a Random Stream of Customers. In Proceedings of the 2017 ACM Conference on Economics and Computation. 169--186."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2021.1167"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2019.0993"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1323850"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 61st Annual Symposium on Foundations of Computer Science, S. Irani (Ed.). 306--317","author":"D\u00fctting P.","unstructured":"P. D\u00fctting , T. Kesselheim , and B. Lucier . 2020b. An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions . In Proceedings of the 61st Annual Symposium on Foundations of Computer Science, S. Irani (Ed.). 306--317 . P. D\u00fctting, T. Kesselheim, and B. Lucier. 2020b. An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions. In Proceedings of the 61st Annual Symposium on Foundations of Computer Science, S. Irani (Ed.). 306--317."},{"key":"e_1_3_2_1_10_1","volume-title":"Polymatroid Prophet Inequalities. In Proceedings of the 23rd Annual European Symposium on Algorithms","volume":"9294","author":"D\u00fctting P.","unstructured":"P. D\u00fctting and R. Kleinberg . 2015 . Polymatroid Prophet Inequalities. In Proceedings of the 23rd Annual European Symposium on Algorithms , Vol. 9294 . 437--449. P. D\u00fctting and R. Kleinberg. 2015. Polymatroid Prophet Inequalities. In Proceedings of the 23rd Annual European Symposium on Algorithms, Vol. 9294. 437--449."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1029394"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 26th Symposium on Discrete Algorithms. 123--135","author":"Feldman M.","unstructured":"M. Feldman , N. Gravin , and B. Lucier . 2015. Combinatorial Auctions via Posted Prices . In Proceedings of the 26th Symposium on Discrete Algorithms. 123--135 . M. Feldman, N. Gravin, and B. Lucier. 2015. Combinatorial Auctions via Posted Prices. In Proceedings of the 26th Symposium on Discrete Algorithms. 123--135."},{"key":"e_1_3_2_1_13_1","volume-title":"The Temp Secretary Problem. In 23rd Annual European Symposium on Algorithms","volume":"9294","author":"Fiat A.","unstructured":"A. Fiat , I. Gorelik , H. Kaplan , and S. Novgorodov . 2015 . The Temp Secretary Problem. In 23rd Annual European Symposium on Algorithms , Vol. 9294 . 631--642. A. Fiat, I. Gorelik, H. Kaplan, and S. Novgorodov. 2015. The Temp Secretary Problem. In 23rd Annual European Symposium on Algorithms, Vol. 9294. 631--642."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1966.10502008"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the 22nd Conference on Artificial Intelligence. 58--65","author":"Hajiaghayi M.","unstructured":"M. Hajiaghayi , R. Kleinberg , and T. Sandholm . 2007. Automated Online Mechanism Design and Prophet Inequalities . In Proceedings of the 22nd Conference on Artificial Intelligence. 58--65 . M. Hajiaghayi, R. Kleinberg, and T. Sandholm. 2007. Automated Online Mechanism Design and Prophet Inequalities. In Proceedings of the 22nd Conference on Artificial Intelligence. 58--65."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993861"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0047-259X(86)90095-3"},{"key":"e_1_3_2_1_18_1","volume-title":"Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions. In 24th Annual European Symposium on Algorithms","volume":"57","author":"Kesselheim T.","unstructured":"T. Kesselheim and A. T\u00f6nnis . 2016 . Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions. In 24th Annual European Symposium on Algorithms , Vol. 57 . 54:1--54:17. T. Kesselheim and A. T\u00f6nnis. 2016. Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions. In 24th Annual European Symposium on Algorithms, Vol. 57. 54:1--54:17."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2014.11.002"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"key":"e_1_3_2_1_21_1","first-page":"197","article-title":"On semimarts, amarts, and processes with finite value","volume":"4","author":"Krengel U.","year":"1978","unstructured":"U. Krengel and L. Sucheston . 1978 . On semimarts, amarts, and processes with finite value . Adv. in Probability 4 (1978), 197 -- 266 . U. Krengel and L. Sucheston. 1978. On semimarts, amarts, and processes with finite value. Adv. in Probability 4 (1978), 197--266.","journal-title":"Adv. in Probability"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993150"}],"event":{"name":"EC '23: 24th ACM Conference on Economics and Computation","location":"London United Kingdom","acronym":"EC '23","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 24th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580507.3597741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:23:57Z","timestamp":1688739837000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597741"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":22,"alternative-id":["10.1145\/3580507.3597741","10.1145\/3580507"],"URL":"http:\/\/dx.doi.org\/10.1145\/3580507.3597741","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"}}]}}