{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T19:11:21Z","timestamp":1751483481351,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Independent Research Fund Denmark, Natural Sciences","award":["DFF-0135-00018B"],"award-info":[{"award-number":["DFF-0135-00018B"]}]},{"name":"DARPA QuICC"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2218678","2114269"],"award-info":[{"award-number":["2218678","2114269"]}],"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":[[2023,7,9]]},"DOI":"10.1145\/3580507.3597813","type":"proceedings-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:19:22Z","timestamp":1688739562000},"page":"490-510","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Trading Prophets"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3012-7622","authenticated-orcid":false,"given":"Jose","family":"Correa","sequence":"first","affiliation":[{"name":"Universidad de Chile, Santiago, Chile"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1227-2092","authenticated-orcid":false,"given":"Andr\u00e9s","family":"Cristi","sequence":"additional","affiliation":[{"name":"Universidad de Chile, Santiago, Chile"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0635-6812","authenticated-orcid":false,"given":"Paul","family":"Duetting","sequence":"additional","affiliation":[{"name":"Google Research, Zurich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4842-0533","authenticated-orcid":false,"given":"MohammadTaghi","family":"Hajiaghayi","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9278-3935","authenticated-orcid":false,"given":"Jan","family":"Olkowski","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2236-0210","authenticated-orcid":false,"given":"Kevin","family":"Schewior","sequence":"additional","affiliation":[{"name":"University of Southern Denmark, Odense, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/3055399.3055479","volume-title":"ACM SIGACT Symposium on Theory of Computing (STOC)","author":"Abolhassani Melika","year":"2017","unstructured":"Melika Abolhassani , Soheil Ehsani , Hossein Esfandiari , MohammadTaghi Hajiaghayi , Robert D. Kleinberg , and Brendan Lucier . Beating 1 \u2212 1\/e for ordered prophets . In ACM SIGACT Symposium on Theory of Computing (STOC) , pages 61 -- 71 , 2017 . Melika Abolhassani, Soheil Ehsani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Robert D. Kleinberg, and Brendan Lucier. Beating 1 \u2212 1\/e for ordered prophets. In ACM SIGACT Symposium on Theory of Computing (STOC), pages 61--71, 2017."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/120878422"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/290169"},{"key":"e_1_3_2_1_4_1","first-page":"202","volume-title":"ACM Conference on Economics and Computation (EC)","author":"Braun Alexander","year":"2021","unstructured":"Alexander Braun and Thomas Kesselheim . Truthful mechanisms for two-sided markets via prophet inequalities . In ACM Conference on Economics and Computation (EC) , pages 202 -- 203 , 2021 . Alexander Braun and Thomas Kesselheim. Truthful mechanisms for two-sided markets via prophet inequalities. In ACM Conference on Economics and Computation (EC), pages 202--203, 2021."},{"key":"e_1_3_2_1_5_1","first-page":"589","volume-title":"ACM Conference on Economics and Computation (EC)","author":"Brustle Johannes","year":"2017","unstructured":"Johannes Brustle , Yang Cai , Fa Wu , and Mingfei Zhao . Approximating gains from trade in two-sided markets via simple mechanisms . In ACM Conference on Economics and Computation (EC) , pages 589 -- 590 , 2017 . Johannes Brustle, Yang Cai, Fa Wu, and Mingfei Zhao. Approximating gains from trade in two-sided markets via simple mechanisms. In ACM Conference on Economics and Computation (EC), pages 589--590, 2017."},{"key":"e_1_3_2_1_6_1","first-page":"1298","volume-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Caramanis Constantine","year":"2022","unstructured":"Constantine Caramanis , Paul D\u00fctting , Matthew Faw , Federico Fusco , Philip Lazos , Stefano Leonardi , Orestis Papadigenopoulos , Emmanouil Pountourakis , and Rebecca Reiffenh\u00e4user . Single-sample prophet inequalities via greedy-ordered selection . In ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 1298 -- 1325 , 2022 . Constantine Caramanis, Paul D\u00fctting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, and Rebecca Reiffenh\u00e4user. Single-sample prophet inequalities via greedy-ordered selection. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1298--1325, 2022."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2307\/1909935"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1137\/1.9781611974331.ch98","volume-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Colini-Baldeschi Riccardo","year":"2016","unstructured":"Riccardo Colini-Baldeschi , Bart de Keijzer , Stefano Leonardi , and Stefano Turchetta . Approximately efficient double auctions with strong budget balance . In ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 1424 -- 1443 , 2016 . Riccardo Colini-Baldeschi, Bart de Keijzer, Stefano Leonardi, and Stefano Turchetta. Approximately efficient double auctions with strong budget balance. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1424--1443, 2016."},{"key":"e_1_3_2_1_9_1","first-page":"591","volume-title":"ACM Conference on Economics and Computation (EC)","author":"Colini-Baldeschi Riccardo","year":"2017","unstructured":"Riccardo Colini-Baldeschi , Paul W. Goldberg , Bart de Keijzer , Stefano Leonardi , Tim Roughgarden , and Stefano Turchetta . Approximately efficient two-sided combinatorial auctions . In ACM Conference on Economics and Computation (EC) , pages 591 -- 608 , 2017 a. Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, and Stefano Turchetta. Approximately efficient two-sided combinatorial auctions. In ACM Conference on Economics and Computation (EC), pages 591--608, 2017a."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/978-3-319-71924-5_11","volume-title":"International Conference on Web and Internet Economics (WINE)","author":"Colini-Baldeschi Riccardo","year":"2017","unstructured":"Riccardo Colini-Baldeschi , Paul W. Goldberg , Bart de Keijzer , Stefano Leonardi , and Stefano Turchetta . Fixed price approximability of the optimal gain from trade . In International Conference on Web and Internet Economics (WINE) , pages 146 -- 160 , 2017 b. Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, and Stefano Turchetta. Fixed price approximability of the optimal gain from trade. In International Conference on Web and Internet Economics (WINE), pages 146--160, 2017b."},{"key":"e_1_3_2_1_11_1","first-page":"3","volume-title":"ACM Conference on Economics and Computation (EC)","author":"Correa Jos\u00e9 R.","year":"2019","unstructured":"Jos\u00e9 R. Correa , Paul D\u00fctting , Felix A. Fischer , and Kevin Schewior . Prophet inequalities for I.I.D. random variables from an unknown distribution . In ACM Conference on Economics and Computation (EC) , pages 3 -- 17 , 2019 . Jos\u00e9 R. Correa, Paul D\u00fctting, Felix A. Fischer, and Kevin Schewior. Prophet inequalities for I.I.D. random variables from an unknown distribution. In ACM Conference on Economics and Computation (EC), pages 3--17, 2019."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","first-page":"2066","DOI":"10.1137\/1.9781611975994.127","volume-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Correa Jos\u00e9 R.","year":"2020","unstructured":"Jos\u00e9 R. Correa , Andr\u00e9s Cristi , Boris Epstein , and Jos\u00e9 A. Soto . The two-sided game of googol and sample-based prophet inequalities . In ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 2066 -- 2081 , 2020 . Jos\u00e9 R. Correa, Andr\u00e9s Cristi, Boris Epstein, and Jos\u00e9 A. Soto. The two-sided game of googol and sample-based prophet inequalities. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2066--2081, 2020."},{"key":"e_1_3_2_1_13_1","first-page":"1","volume-title":"Innovations in Theoretical Computer Science Conference (ITCS)","author":"Correa Jos\u00e9 R.","year":"2021","unstructured":"Jos\u00e9 R. Correa , Paul D\u00fctting , Felix A. Fischer , Kevin Schewior , and Bruno Ziliotto . Unknown I.I.D. prophets : Better bounds, streaming algorithms and a new impossibility . In Innovations in Theoretical Computer Science Conference (ITCS) , pages 86: 1 -- 86 :1, 2021 a. Jos\u00e9 R. Correa, Paul D\u00fctting, Felix A. Fischer, Kevin Schewior, and Bruno Ziliotto. Unknown I.I.D. prophets: Better bounds, streaming algorithms and a new impossibility. In Innovations in Theoretical Computer Science Conference (ITCS), pages 86:1--86:1, 2021a."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2020.1105"},{"issue":"1","key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10107-020-01544-8","article-title":"Prophet secretary through blind strategies","volume":"190","author":"Correa Jos\u00e9 R.","year":"2021","unstructured":"Jos\u00e9 R. Correa , Raimundo Saona , and Bruno Ziliotto . Prophet secretary through blind strategies . Mathematical Programming , 190 ( 1 ): 483 -- 521 , 2021 c. Jos\u00e9 R. Correa, Raimundo Saona, and Bruno Ziliotto. Prophet secretary through blind strategies. Mathematical Programming, 190(1):483--521, 2021c.","journal-title":"Mathematical Programming"},{"key":"e_1_3_2_1_16_1","volume-title":"A semester virtual institute. https:\/\/cacm.acm.org\/blogs\/blog-cacm\/258538-a-semester-virtual-institute\/fulltext","author":"Correa Jose R.","year":"2022","unstructured":"Jose R. Correa , Jason Hartline , and Nicole Immorlica . A semester virtual institute. https:\/\/cacm.acm.org\/blogs\/blog-cacm\/258538-a-semester-virtual-institute\/fulltext , 2022 . Jose R. Correa, Jason Hartline, and Nicole Immorlica. A semester virtual institute. https:\/\/cacm.acm.org\/blogs\/blog-cacm\/258538-a-semester-virtual-institute\/fulltext, 2022."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/3519935.3520054","volume-title":"ACM SIGACT Symposium on Theory of Computing (STOC)","author":"Deng Yuan","year":"2022","unstructured":"Yuan Deng , Jieming Mao , Balasubramanian Sivan , and Kangning Wang . Approximately efficient bilateral trade . In ACM SIGACT Symposium on Theory of Computing (STOC) , pages 718 -- 721 , 2022 . Yuan Deng, Jieming Mao, Balasubramanian Sivan, and Kangning Wang. Approximately efficient bilateral trade. In ACM SIGACT Symposium on Theory of Computing (STOC), pages 718--721, 2022."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1214\/009117906000000638"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1214\/08-AAP566"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","first-page":"1452","DOI":"10.1145\/3406325.3451076","volume-title":"ACM SIGACT Symposium on Theory of Computing (STOC)","author":"D\u00fctting Paul","year":"2021","unstructured":"Paul D\u00fctting , Federico Fusco , Philip Lazos , Stefano Leonardi , and Rebecca Reiffenh\u00e4user . Efficient two-sided markets with limited information . In ACM SIGACT Symposium on Theory of Computing (STOC) , pages 1452 -- 1465 , 2021 . Paul D\u00fctting, Federico Fusco, Philip Lazos, Stefano Leonardi, and Rebecca Reiffenh\u00e4user. Efficient two-sided markets with limited information. In ACM SIGACT Symposium on Theory of Computing (STOC), pages 1452--1465, 2021."},{"key":"e_1_3_2_1_21_1","first-page":"700","volume-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Ehsani Soheil","year":"2018","unstructured":"Soheil Ehsani , MohammadTaghi Hajiaghayi , Thomas Kesselheim , and Sahil Singla . Prophet secretary for combinatorial auctions and matroids . In ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 700 -- 714 , 2018 . Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, and Sahil Singla. Prophet secretary for combinatorial auctions and matroids. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 700--714, 2018."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1029394"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/S0040585X97978075","article-title":"Stopping brownian motion without anticipation as close as possible to its ultimate maximum","volume":"45","author":"Graversen Svend E.","year":"2006","unstructured":"Svend E. Graversen , Goran Peskir , and Albert N. Shiryaev . Stopping brownian motion without anticipation as close as possible to its ultimate maximum . Theory of Probability and its Applications , 45 : 41 -- 50 , 2006 . Svend E. Graversen, Goran Peskir, and Albert N. Shiryaev. Stopping brownian motion without anticipation as close as possible to its ultimate maximum. Theory of Probability and its Applications, 45:41--50, 2006.","journal-title":"Theory of Probability and its Applications"},{"key":"e_1_3_2_1_24_1","first-page":"287","volume-title":"ACM Conference on Economics and Computation (EC)","author":"Jon","year":"2018","unstructured":"Jon M. Kleinberg and Robert Kleinberg. Delegated search approximates efficient search . In ACM Conference on Economics and Computation (EC) , pages 287 -- 302 , 2018 . Jon M. Kleinberg and Robert Kleinberg. Delegated search approximates efficient search. In ACM Conference on Economics and Computation (EC), pages 287--302, 2018."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"key":"e_1_3_2_1_26_1","first-page":"197","article-title":"On semiamarts, amarts, and processes with finite value","volume":"4","author":"Krengel Ulrich","year":"1978","unstructured":"Ulrich Krengel and Louis Sucheston . On semiamarts, amarts, and processes with finite value . Advances in Probability and Related Topics , 4 : 197 -- 266 , 1978 . Ulrich Krengel and Louis Sucheston. On semiamarts, amarts, and processes with finite value. Advances in Probability and Related Topics, 4:197--266, 1978.","journal-title":"Advances in Probability and Related Topics"},{"key":"e_1_3_2_1_27_1","first-page":"1","article-title":"Online portfolio selection: A survey","volume":"46","author":"Li Bin","year":"2014","unstructured":"Bin Li and Steven C. Hoi . Online portfolio selection: A survey . ACM Computing Surveys , 46 : 1 -- 33 , 2014 . Bin Li and Steven C. Hoi. Online portfolio selection: A survey. ACM Computing Surveys, 46:1--33, 2014.","journal-title":"ACM Computing Surveys"},{"key":"e_1_3_2_1_28_1","first-page":"692","volume-title":"ACM Conference on Economics and Computation (EC)","author":"Liu Allen","year":"2021","unstructured":"Allen Liu , Renato Paes Leme , Martin P\u00e1l , Jon Schneider , and Balasubramanian Sivan . Variable decomposition for prophet inequalities and optimal ordering . In ACM Conference on Economics and Computation (EC) , page 692 , 2021 . Allen Liu, Renato Paes Leme, Martin P\u00e1l, Jon Schneider, and Balasubramanian Sivan. Variable decomposition for prophet inequalities and optimal ordering. In ACM Conference on Economics and Computation (EC), page 692, 2021."},{"key":"e_1_3_2_1_29_1","first-page":"1","article-title":"The gains from trade under fixed price mechanisms","volume":"1","author":"McAfee R. Preston","year":"2008","unstructured":"R. Preston McAfee . The gains from trade under fixed price mechanisms . Applied Economics Research Bulletin , 1 : 1 -- 10 , 2008 . R. Preston McAfee. The gains from trade under fixed price mechanisms. Applied Economics Research Bulletin, 1:1--10, 2008.","journal-title":"Applied Economics Research Bulletin"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(83)90048-0"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.7.2.145"},{"key":"e_1_3_2_1_32_1","first-page":"1","volume-title":"Innovations in Theoretical Computer Science Conference (ITCS)","author":"Rubinstein Aviad","year":"2020","unstructured":"Aviad Rubinstein , Jack Z. Wang , and S. Matthew Weinberg . Optimal single-choice prophet inequalities from samples . In Innovations in Theoretical Computer Science Conference (ITCS) , pages 60: 1 -- 60 :10, 2020 . Aviad Rubinstein, Jack Z. Wang, and S. Matthew Weinberg. Optimal single-choice prophet inequalities from samples. In Innovations in Theoretical Computer Science Conference (ITCS), pages 60:1--60:10, 2020."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993150"}],"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.3597813","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580507.3597813","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:34Z","timestamp":1750178794000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":33,"alternative-id":["10.1145\/3580507.3597813","10.1145\/3580507"],"URL":"https:\/\/doi.org\/10.1145\/3580507.3597813","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"}}]}}