{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T19:11:26Z","timestamp":1751483486341,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"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\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["866132"],"award-info":[{"award-number":["866132"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["DMS-1928930","BSF-2020788"],"award-info":[{"award-number":["DMS-1928930","BSF-2020788"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","award":["G-2021-16778"],"award-info":[{"award-number":["G-2021-16778"]}],"id":[{"id":"10.13039\/100000879","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.3673628","type":"proceedings-article","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T20:13:33Z","timestamp":1734466413000},"page":"246-265","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Stopping with Interdependent Values"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4080-3118","authenticated-orcid":false,"given":"Simon","family":"Mauras","sequence":"first","affiliation":[{"name":"FairPlay joint team, INRIA, Saclay, France"},{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8671-5714","authenticated-orcid":false,"given":"Divyarthi","family":"Mohan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Tel Aviv University, Tel Aviv, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0959-2589","authenticated-orcid":false,"given":"Rebecca","family":"Reiffenh\u00e4user","sequence":"additional","affiliation":[{"name":"Institute for Logic, Language and Computation, University of Amsterdam, Amsterdam, Netherlands"}]}],"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\/2229012.2229018"},{"key":"e_1_3_2_1_2_1","volume-title":"Auctions with Interdependence and SOS: Improved Approximation. In 14th International Symposium on Algorithmic Game Theory (SAGT).","author":"Amer Ameer","year":"2021","unstructured":"Ameer Amer and Inbal Talgam-Cohen. 2021. Auctions with Interdependence and SOS: Improved Approximation. In 14th International Symposium on Algorithmic Game Theory (SAGT)."},{"key":"e_1_3_2_1_3_1","unstructured":"Lawrence M Ausubel et al. 1999. A generalized Vickrey auction. Econometrica (1999)."},{"key":"e_1_3_2_1_4_1","unstructured":"Moshe Babaioff Nicole Immorlica and Robert Kleinberg. 2007. Matroids secretary problems and online mechanisms. SODA 434--443."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2305.14096"},{"key":"e_1_3_2_1_6_1","unstructured":"Antoine Brunel and Ulrich Krengel. 1979. Parier avec un proph\u00e8te dans le cas d'un processus sous-additif. (1979). https:\/\/gallica.bnf.fr\/ark:\/12148\/bpt6k98138170\/f73.item"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2009.07.004"},{"key":"e_1_3_2_1_8_1","volume-title":"Approximate Revenue Maximization in Interdependent Value Settings. In 15th ACM Conference on Economics and Computation (EC).","author":"Chawla Shuchi","year":"2014","unstructured":"Shuchi Chawla, Hu Fu, and Anna Karlin. 2014. Approximate Revenue Maximization in Interdependent Value Settings. In 15th ACM Conference on Economics and Computation (EC)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807406.1807428"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2015.03.008"},{"key":"e_1_3_2_1_11_1","volume-title":"13th Innovations in Theoretical Computer Science Conference (ITCS","author":"Chen Yiling","year":"2022","unstructured":"Yiling Chen, Alon Eden, and Juntao Wang. 2022. Cursed yet Satisfied Agents. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)."},{"key":"e_1_3_2_1_12_1","volume-title":"Interdependent Public Projects. In 34th ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Cohen Avi","year":"2023","unstructured":"Avi Cohen, Michal Feldman, Divyarthi Mohan, and Inbal Talgam-Cohen. 2023. Interdependent Public Projects. In 34th ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"Jose Correa and Andr\u00e9s Cristi. 2023. A Constant Factor Prophet Inequality for Online Combinatorial Auctions. 686--697. 10.1145\/3564246.3585151","DOI":"10.1145\/3564246.3585151"},{"key":"e_1_3_2_1_14_1","volume-title":"The Quarterly Journal of Economics","author":"Dasgupta Partha","year":"2000","unstructured":"Partha Dasgupta and Eric Maskin. 2000. Efficient Auctions. The Quarterly Journal of Economics (2000)."},{"key":"e_1_3_2_1_15_1","volume-title":"The Optimum Choice of the Instant for Stopping a Markov Process. Soviet Mathematics. Doklady 4 (01","author":"Dynkin E.","year":"1963","unstructured":"E. Dynkin. 1963. The Optimum Choice of the Instant for Stopping a Markov Process. Soviet Mathematics. Doklady 4 (01 1963)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1323850"},{"key":"e_1_3_2_1_17_1","volume-title":"Interdependent Values Without Single-Crossing. In 19th ACM Conference on Economics and Computation (EC).","author":"Eden Alon","year":"2018","unstructured":"Alon Eden, Michal Feldman, Amos Fiat, and Kira Goldner. 2018. Interdependent Values Without Single-Crossing. In 19th ACM Conference on Economics and Computation (EC)."},{"volume-title":"20th ACM Conference on Economics and Computation (EC).","author":"Eden Alon","key":"e_1_3_2_1_18_1","unstructured":"Alon Eden, Michal Feldman, Amos Fiat, Kira Goldner, and Anna R. Karlin. 2019. Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue. In 20th ACM Conference on Economics and Computation (EC)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00018"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2402.12017"},{"key":"e_1_3_2_1_21_1","volume-title":"PoA of Simple Auctions with Interdependent Values. In 35th AAAI Conference on Artificial Intelligence (AAAI).","author":"Eden Alon","year":"2021","unstructured":"Alon Eden, Michal Feldman, Inbal Talgam-Cohen, and Ori Zviran. 2021. PoA of Simple Auctions with Interdependent Values. In 35th AAAI Conference on Artificial Intelligence (AAAI)."},{"key":"e_1_3_2_1_22_1","volume-title":"Private Interdependent Valuations. In 33rd ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Eden Alon","year":"2022","unstructured":"Alon Eden, Kira Goldner, and Shuran Zheng. 2022. Private Interdependent Valuations. In 33rd ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_3_2_1_23_1","unstructured":"The Committee for the Prize in Economic Sciences in Memory of Alfred Nobel. 2020. Scientifc Background on the Sveriges Riksbank Prize in Economic Sciences. https:\/\/www.nobelprize.org\/uploads\/2020\/09\/advanced-economicsciencesprize2020.pdf"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-85947-3_5"},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the National Conference on Artificial Intelligence 1, 58--65","author":"Hajiaghayi Mohammad","year":"2007","unstructured":"Mohammad Hajiaghayi, Robert Kleinberg, and Tuomas Sandholm. 2007. Automated Online Mechanism Design and Prophet Inequalities. Proceedings of the National Conference on Artificial Intelligence 1, 58--65."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3623273"},{"volume-title":"Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems. 1151--1158","author":"Ito Takayuki","key":"e_1_3_2_1_27_1","unstructured":"Takayuki Ito and David C. Parkes. 2006. Instantiating the Contingent Bids Model of Truthful Interdependent Value Auctions. In Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems. 1151--1158."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00240"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0262.2006.00675.x"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","unstructured":"Thomas Kesselheim Klaus Radke Andreas Abels and Berthold V\u00f6cking. 2013. An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions. 10.1007\/978-3-642-40450-4_50","DOI":"10.1007\/978-3-642-40450-4_50"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213991"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0014-2921(97)00123-2"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"key":"e_1_3_2_1_34_1","unstructured":"Ulrich Krengel and L. Sucheston. 1978. On semiamarts amarts and processes with finite value. Probability on Banach Spaces (01 1978) 197--266."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2005.02.006"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482580"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22832-2_13"},{"key":"e_1_3_2_1_38_1","volume-title":"(Institut fur Weltwirtschaften der Universit\u00e4t Kiel: 1992)","author":"Maskin Eric","year":"1992","unstructured":"Eric Maskin. 1992. Auctions and Privatization. Privatization, H. Siebert, ed. (Institut fur Weltwirtschaften der Universit\u00e4t Kiel: 1992) (1992)."},{"key":"e_1_3_2_1_39_1","volume-title":"A theory of auctions and competitive bidding. Econometrica","author":"Milgrom Paul R","year":"1982","unstructured":"Paul R Milgrom and Robert J Weber. 1982. A theory of auctions and competitive bidding. Econometrica (1982)."},{"key":"e_1_3_2_1_40_1","volume-title":"Optimal auction design. Mathematics of operations research 6, 1","author":"Myerson Roger B","year":"1981","unstructured":"Roger B Myerson. 1981. Optimal auction design. Mathematics of operations research 6, 1 (1981), 58--73."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.120"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Tim Roughgarden and Inbal Talgam-Cohen. 2016. Optimal and Robust Mechanism Design with Interdependent Values. ACM Trans. Econ. Comput. (2016).","DOI":"10.1145\/2910577"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993150"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-7152(91)90080-B"},{"key":"e_1_3_2_1_45_1","volume-title":"Communications to the editor","author":"Wilson Robert B","year":"1969","unstructured":"Robert B Wilson. 1969. Communications to the editor---competitive bidding with disparate information. Management science (1969)."},{"key":"e_1_3_2_1_46_1","volume-title":"Probabilistic Computations: Toward a Unified Measure of Complexity (Extended Abstract)","author":"Chi-Chih Yao Andrew","year":"1977","unstructured":"Andrew Chi-Chih Yao. 1977. Probabilistic Computations: Toward a Unified Measure of Complexity (Extended Abstract). In FOCS. IEEE Computer Society, 222--227."}],"event":{"name":"EC '24: 25th ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"New Haven CT USA","acronym":"EC '24"},"container-title":["Proceedings of the 25th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673628","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673628","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673628","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:01Z","timestamp":1750295401000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673628"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":46,"alternative-id":["10.1145\/3670865.3673628","10.1145\/3670865"],"URL":"https:\/\/doi.org\/10.1145\/3670865.3673628","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"}}]}}