{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T09:59:59Z","timestamp":1775815199171,"version":"3.50.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031489730","type":"print"},{"value":"9783031489747","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-48974-7_15","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"256-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The Importance of\u00a0Knowing the\u00a0Arrival Order in\u00a0Combinatorial Bayesian Settings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0626-4851","authenticated-orcid":false,"given":"Tomer","family":"Ezra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-3922-4160","authenticated-orcid":false,"given":"Tamar","family":"Garbuz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Sethuraman, J., Zhang, X.: On optimal ordering in the optimal stopping problem. In: EC 2020: The 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, 13\u201317 July 2020, pp. 187\u2013188. ACM (2020)","DOI":"10.1145\/3391403.3399484"},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1137\/120878422","volume":"43","author":"S Alaei","year":"2014","unstructured":"Alaei, S.: Bayesian combinatorial auctions: expanding single buyer mechanisms to many buyers. SIAM J. Comput. 43(2), 930\u2013972 (2014)","journal-title":"SIAM J. Comput."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Arsenis, M., Drosis, O., Kleinberg, R.: Constrained-order prophet inequalities. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2034\u20132046. SIAM (2021)","DOI":"10.1137\/1.9781611976465.121"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Azar, P.D., Kleinberg, R., Weinberg, S.M.: Prophet inequalities with limited information. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1358\u20131377. SIAM (2014)","DOI":"10.1137\/1.9781611973402.100"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Azar, Y., Chiplunkar, A., Kaplan, H.: Prophet secretary: surpassing the 1-1\/e barrier. In: Proceedings of the 2018 ACM Conference on Economics and Computation, pp. 303\u2013318 (2018)","DOI":"10.1145\/3219166.3219182"},{"key":"15_CR6","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: Symposium on Discrete Algorithms (SODA 2007), pp. 434\u2013443 (2007)"},{"key":"15_CR7","unstructured":"Beyhaghi, H., Golrezaei, N., Leme, R.P., Pal, M., Sivan, B.: Improved approximations for free-order prophets and second-price auctions. arXiv preprint arXiv:1807.03435 (2018)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Braverman, M., Derakhshan, M., Lovett, A.M.: Max-weight online stochastic matching: improved approximations against the online benchmark. In: EC 2022: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, 11\u201315 July 2022, pp, 967\u2013985. ACM (2022)","DOI":"10.1145\/3490486.3538315"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10107-020-01544-8","volume":"190","author":"JR Correa","year":"2021","unstructured":"Correa, J.R., Saona, R., Ziliotto, B.: Prophet secretary through blind strategies. Math. Program. 190(1), 483\u2013521 (2021)","journal-title":"Math. Program."},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/20M1323850","volume":"49","author":"P Dutting","year":"2020","unstructured":"Dutting, P., Feldman, M., Kesselheim, T., Lucier, B.: Prophet inequalities made easy: Stochastic optimization by pricing nonstochastic inputs. SIAM J. Comput. 49(3), 540\u2013582 (2020)","journal-title":"SIAM J. Comput."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Kesselheim, T., Lucier, B.: An o(log log m) prophet inequality for subadditive combinatorial auctions. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, 16\u201319 November 2020, pp. 306\u2013317 (2020)","DOI":"10.1109\/FOCS46700.2020.00037"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-662-48350-3_37","volume-title":"Algorithms - ESA 2015","author":"P D\u00fctting","year":"2015","unstructured":"D\u00fctting, P., Kleinberg, R.: Polymatroid prophet inequalities. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 437\u2013449. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_37"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Ehsani, S., Hajiaghayi, M., Kesselheim, T., Singla, S.: Prophet secretary for combinatorial auctions and matroids. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 700\u2013714. SIAM (2018)","DOI":"10.1137\/1.9781611975031.46"},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1137\/15M1029394","volume":"31","author":"H Esfandiari","year":"2017","unstructured":"Esfandiari, H., Hajiaghayi, M., Liaghat, V., Monemizadeh, M.: Prophet secretary. SIAM J. Discrete Math. 31(3), 1685\u20131701 (2017)","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Ezra, T., Feldman, M., Gravin, N., Tang, Z.G.: Prophet matching with general arrivals. Math. Oper. Res. 47(2), 878\u2013898 (2022)","DOI":"10.1287\/moor.2021.1152"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Ezra, T., Feldman, M., Gravin, N., Tang, Z.G.: \u201cWho is next in line?\u201d On the significance of knowing the arrival order in Bayesian online settings. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 3759\u20133776. Society for Industrial and Applied Mathematics (2023)","DOI":"10.1137\/1.9781611977554.ch145"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Ezra, T., Garbuz, T.: The importance of knowing the arrival order in combinatorial Bayesian settings. arXiv preprint arXiv:2307.02610 (2023)","DOI":"10.1007\/978-3-031-48974-7_15"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Feldman, M., Gravin, N., Lucier, B.: Combinatorial auctions via posted prices. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 123\u2013135. SIAM (2014)","DOI":"10.1137\/1.9781611973730.10"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Gravin, N., Wang, H.: Prophet inequality for bipartite matching: merits of being simple and non adaptive. In: EC, pp. 93\u2013109. ACM (2019)","DOI":"10.1145\/3328526.3329604"},{"key":"15_CR20","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Sandholm, T.: Automated online mechanism design and prophet inequalities. In: AAAI, vol. 7, pp. 58\u201365 (2007)"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Kennedy, D.P.: Optimal stopping of independent random variables and maximizing prophets. Ann. Probab. 566\u2013571 (1985)","DOI":"10.1214\/aop\/1176993009"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-4149(87)90029-9","volume":"24","author":"DP Kennedy","year":"1987","unstructured":"Kennedy, D.P.: Prophet-type inequalities for multi-choice optimal stopping. Stoch. Process. Their Appl. 24(1), 77\u201388 (1987)","journal-title":"Stoch. Process. Their Appl."},{"issue":"2","key":"15_CR23","doi-asserted-by":"publisher","first-page":"311","DOI":"10.2307\/1427302","volume":"18","author":"RP Kertz","year":"1986","unstructured":"Kertz, R.P.: Comparison of optimal value and constrained maxima expectations for independent random variables. Adv. Appl. Probab. 18(2), 311\u2013340 (1986)","journal-title":"Adv. Appl. Probab."},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Kessel, K., Shameli, A., Saberi, A., Wajc, D.: The stationary prophet inequality problem. In: Proceedings of the 23rd ACM Conference on Economics and Computation, pp. 243\u2013244 (2022)","DOI":"10.1145\/3490486.3538374"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.geb.2014.11.002","volume":"113","author":"R Kleinberg","year":"2019","unstructured":"Kleinberg, R., Weinberg, S.M.: Matroid prophet inequalities and applications to multi-dimensional mechanism design. Games Econ. Behav. 113, 97\u2013115 (2019)","journal-title":"Games Econ. Behav."},{"issue":"4","key":"15_CR26","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1090\/S0002-9904-1977-14378-4","volume":"83","author":"U Krengel","year":"1977","unstructured":"Krengel, U., Sucheston, L.: Semiamarts and finite values. Bull. Am. Math. Soc. 83(4), 745\u2013747 (1977)","journal-title":"Bull. Am. Math. Soc."},{"key":"15_CR27","first-page":"197","volume":"4","author":"U Krengel","year":"1978","unstructured":"Krengel, U., Sucheston, L.: On semiamarts, amarts, and processes with finite value. Probab. Banach Spaces 4, 197\u2013266 (1978)","journal-title":"Probab. Banach Spaces"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-030-04612-5_24","volume-title":"Web and Internet Economics","author":"R Niazadeh","year":"2018","unstructured":"Niazadeh, R., Saberi, A., Shameli, A.: Prophet inequalities vs. approximating optimum online. In: Christodoulou, G., Harks, T. (eds.) WINE 2018. LNCS, vol. 11316, pp. 356\u2013374. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04612-5_24"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Pollner, T., Saberi, A., Wajc, D.: Online stochastic max-weight bipartite matching: beyond prophet inequalities. In: Proceedings of the 22nd ACM Conference on Economics and Computation, pp. 763\u2013764 (2021)","DOI":"10.1145\/3465456.3467613"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Peng, B., Tang, Z.G.: Order selection prophet inequality: from threshold optimization to arrival time design. In: FOCS (2022, to appear)","DOI":"10.1109\/FOCS54457.2022.00023"},{"key":"15_CR31","unstructured":"Rubinstein, A.: Beyond matroids: secretary problem and prophet inequality with general constraints. In Wichs, D., Mansour, Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016,Cambridge, MA, USA, 18\u201321 June 2016, pp. 324\u2013332. ACM (2016)"},{"key":"15_CR32","unstructured":"Saberi, A., Wajc, D.: The greedy algorithm is not optimal for on-line edge coloring. In: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Samuel-Cahn, E.: Comparison of threshold stop rules and maximum for independent nonnegative random variables. Ann. Probab. 1213\u20131216 (1984)","DOI":"10.1214\/aop\/1176993150"},{"key":"15_CR34","unstructured":"Srinivasan, A., Wajc, D., et al.: Online dependent rounding schemes. arXiv preprint arXiv:2301.08680 (2023)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48974-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T02:04:02Z","timestamp":1703988242000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,31]]},"assertion":[{"value":"31 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2023.shanghaitech.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"221","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29 one-page abstracts accepted","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}