{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:17:22Z","timestamp":1751516242922,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","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\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2600\/2"],"award-info":[{"award-number":["2600\/2"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Amazon Research Award"},{"name":"TAU Center for AI and Data Science"},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-244107"],"award-info":[{"award-number":["CCF-244107"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fondation Math\u00e9matique Jacques Hadamard","award":["P-2024-0034"],"award-info":[{"award-number":["P-2024-0034"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,7]]},"DOI":"10.1145\/3736252.3742518","type":"proceedings-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:49:32Z","timestamp":1751482172000},"page":"189-205","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Combinatorial Allocation with Interdependent Values"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2915-8405","authenticated-orcid":false,"given":"Michal","family":"Feldman","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv - Yafo, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4080-3118","authenticated-orcid":false,"given":"Simon","family":"Mauras","sequence":"additional","affiliation":[{"name":"FairPlay joint team, INRIA, Saclay, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8671-5714","authenticated-orcid":false,"given":"Divyarthi","family":"Mohan","sequence":"additional","affiliation":[{"name":"Boston University, Boston, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0959-2589","authenticated-orcid":false,"given":"Rebecca","family":"Reiffenh\u00e4user","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.121"},{"key":"e_1_3_2_1_2_1","unstructured":"Lawrence M Ausubel et al. 1999. A generalized Vickrey auction. Econometrica (1999)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_2"},{"key":"e_1_3_2_1_4_1","unstructured":"Moshe Babaioff Nicole Immorlica and Robert Kleinberg. 2007a. Matroids secretary problems and online mechanisms. SODA 434\u2013443."},{"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","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_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2015.03.008"},{"key":"e_1_3_2_1_8_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_9_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_10_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_11_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_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1323850"},{"key":"e_1_3_2_1_13_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)."},{"key":"e_1_3_2_1_14_1","volume-title":"Karlin","author":"Eden Alon","year":"2019","unstructured":"Alon Eden, Michal Feldman, Amos Fiat, Kira Goldner, and Anna R. Karlin. 2019. Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue. In EC. ACM, 19\u201320."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00018"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2402.12017"},{"key":"e_1_3_2_1_17_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_18_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_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1029394"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.10"},{"key":"e_1_3_2_1_21_1","volume-title":"Who Solved the Secretary Problem? Statist. Sci. 4, 3 (08","author":"Ferguson Thomas S.","year":"1989","unstructured":"Thomas S. Ferguson. 1989. Who Solved the Secretary Problem? Statist. Sci. 4, 3 (08 1989), 282\u2013289."},{"key":"e_1_3_2_1_22_1","volume-title":"New Mathematical Diversions from Scientific American","author":"Gardner Martin","year":"1960","unstructured":"Martin Gardner. 1966. New Mathematical Diversions from Scientific American. Simon and Schuster, Chapter 3, problem 3. Reprint of the original column published in February 1960 with additional comments."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-85947-3_5"},{"key":"e_1_3_2_1_24_1","volume-title":"Online budgeted matching in random input models with applications to Adwords (SODA '08)","author":"Goel Gagan","unstructured":"Gagan Goel and Aranyak Mehta. 2008. Online budgeted matching in random input models with applications to Adwords (SODA '08). Society for Industrial and Applied Mathematics, USA, 982\u2013991."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2017.133"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems. 1151\u20131158","author":"Ito Takayuki","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\u20131158."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00240"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0262.2006.00675.x"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40450-4_50"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213991"},{"key":"e_1_3_2_1_31_1","volume-title":"A multiple-choice secretary algorithm with applications to online auctions","author":"Kleinberg Robert D.","unstructured":"Robert D. Kleinberg. 2005. A multiple-choice secretary algorithm with applications to online auctions. In SODA. SIAM, 630\u2013631."},{"key":"e_1_3_2_1_32_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Korula Nitish","unstructured":"Nitish Korula and Martin P\u00e1l. 2009. Algorithms for secretary problems on graphs and hypergraphs. In International Colloquium on Automata, Languages, and Programming. Springer, 508\u2013520."},{"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\u2013266."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22832-2_13"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3670865.3673628"},{"key":"e_1_3_2_1_37_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_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00023"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.120"},{"key":"e_1_3_2_1_40_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_41_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993150"},{"key":"e_1_3_2_1_42_1","volume-title":"Communications to the editor","author":"Wilson Robert B","year":"1969","unstructured":"Robert B Wilson. 1969. Communications to the editor\u2014competitive bidding with disparate information. Management science (1969)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.56"}],"event":{"name":"EC '25: 26th ACM Conference on Economics and Computation","location":"Stanford University Stanford CA USA","acronym":"EC '25","sponsor":["SIGecom ACM Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 26th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3736252.3742518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:51:15Z","timestamp":1751482275000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3736252.3742518"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"references-count":43,"alternative-id":["10.1145\/3736252.3742518","10.1145\/3736252"],"URL":"https:\/\/doi.org\/10.1145\/3736252.3742518","relation":{},"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"2025-07-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}