{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T15:49:34Z","timestamp":1773935374845,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046118","type":"print"},{"value":"9783030046125","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04612-5_24","type":"book-chapter","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T15:09:45Z","timestamp":1542726585000},"page":"356-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Prophet Inequalities vs. Approximating Optimum Online"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5880-6221","authenticated-orcid":false,"given":"Rad","family":"Niazadeh","sequence":"first","affiliation":[]},{"given":"Amin","family":"Saberi","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Shameli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Abolhassani, M., Ehsani, S., Esfandiari, H., HajiAghayi, M., Kleinberg, R., Lucier, B.: Beating $$1-1$$\/e for ordered prophets. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 61\u201371. ACM (2017)","DOI":"10.1145\/3055399.3055479"},{"issue":"2","key":"24_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":"24_CR3","doi-asserted-by":"crossref","unstructured":"Alaei, S., Hartline, J., Niazadeh, R., Pountourakis, E., Yuan, Y.: Optimal auctions vs. anonymous pricing. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1446\u20131463. IEEE (2015)","DOI":"10.1109\/FOCS.2015.92"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Anari, N., Niazadeh, R., Saberi, A., Shameli, A.: Nearly optimal pricing algorithms for production constrained and laminar bayesian selection. arXiv preprint arXiv:1807.05477 (2018)","DOI":"10.1145\/3328526.3329652"},{"key":"24_CR5","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. Society for Industrial and Applied Mathematics (2014)","DOI":"10.1137\/1.9781611973402.100"},{"key":"24_CR6","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. ACM (2018)","DOI":"10.1145\/3219166.3219182"},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/2728732.2728736","volume":"13","author":"M Babaioff","year":"2015","unstructured":"Babaioff, M., Immorlica, N., Lucier, B., Weinberg, S.M.: A simple and approximately optimal mechanism for an additive buyer. ACM SIGecom Exch. 13(2), 31\u201335 (2015)","journal-title":"ACM SIGecom Exch."},{"key":"24_CR8","unstructured":"Beyhaghi, H., Golrezaei, N., Leme, R.P., Pal, M., Siva, B.: Improved approximations for free-order prophets and second-price auctions. arXiv preprint arXiv:1807.03435 (2018)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Cai, Y., Daskalakis, C., Weinberg, S.M.: Optimal multi-dimensional mechanism design: reducing revenue to welfare maximization. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 130\u2013139. IEEE (2012)","DOI":"10.1109\/FOCS.2012.88"},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/2994501.2994506","volume":"15","author":"Yang Cai","year":"2016","unstructured":"Cai, Y., Devanur, N.R., Weinberg, S.M.: A duality based unified approach to Bayesian mechanism design. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, pp. 926\u2013939. ACM (2016)","journal-title":"ACM SIGecom Exchanges"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J.D., Malec, D.L., Sivan, B.: Multi-parameter mechanism design and sequential posted pricing. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 311\u2013320. ACM (2010)","DOI":"10.1145\/1806689.1806733"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Chawla, S., Miller, J.B.: Mechanism design for subadditive agents via an ex-ante relaxation. In: Proceedings of the 2016 ACM Conference on Economics and Computation, pp. 579\u2013596. ACM (2016)","DOI":"10.1145\/2940716.2940756"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Correa, J., Foncea, P., Hoeksma, R., Oosterwijk, T., Vredeveld, T.: Posted price mechanisms for a random stream of customers. In: Proceedings of the 2017 ACM Conference on Economics and Computation, pp. 169\u2013186. ACM (2017)","DOI":"10.1145\/3033274.3085137"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Correa, J., Saona, R., Ziliotto, B.: Prophet secretary through blind strategies. arXiv preprint arXiv:1807.07483 (2018)","DOI":"10.1137\/1.9781611975482.118"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"D\u00fcetting, P., Feldman, M., Kesselheim, T., Lucier, B.: Prophet inequalities made easy: stochastic optimization by pricing non-stochastic inputs. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 540\u2013551. IEEE (2017)","DOI":"10.1109\/FOCS.2017.56"},{"key":"24_CR16","unstructured":"D\u00fctting, P., Fischer, F., Klimm, M.: Revenue gaps for discriminatory and anonymous sequential posted pricing. arXiv preprint arXiv:1607.07105 (2016)"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/1.9781611975031.46","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Soheil Ehsani","year":"2018","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)"},{"issue":"3","key":"24_CR18","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":"24_CR19","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fu, H., Gravin, N., Lucier, B.: Simultaneous auctions are (almost) efficient. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 201\u2013210. ACM (2013)","DOI":"10.1145\/2488608.2488634"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Feldman, M., Svensson, O., Zenklusen, R.: Online contention resolution schemes. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1014\u20131033. Society for Industrial and Applied Mathematics (2016)","DOI":"10.1137\/1.9781611974331.ch72"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-662-43951-7_43","volume-title":"Automata, Languages, and Programming","author":"O G\u00f6bel","year":"2014","unstructured":"G\u00f6bel, O., Hoefer, M., Kesselheim, T., Schleiden, T., V\u00f6cking, B.: Online independent set beyond the worst-case: secretaries, prophets, and periods. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 508\u2013519. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_43"},{"key":"24_CR22","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Sandholm, T.: Automated online mechanism design and prophet inequalities. AAAI. vol. 7, pp. 58\u201365 (2007)"},{"issue":"3","key":"24_CR23","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1257\/aer.102.3.330","volume":"102","author":"JD Hartline","year":"2012","unstructured":"Hartline, J.D.: Approximation in mechanism design. Am. Econ. Rev. 102(3), 330\u2013336 (2012)","journal-title":"Am. Econ. Rev."},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Roughgarden, T.: Simple versus optimal mechanisms. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 225\u2013234. ACM (2009)","DOI":"10.1145\/1566374.1566407"},{"issue":"2","key":"24_CR25","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1214\/aop\/1176993861","volume":"10","author":"TP Hill","year":"1982","unstructured":"Hill, T.P., Kertz, R.P.: Comparisons of stop rule and supremum expectations of IID random variables. Ann. Probab. 10(2), 336\u2013345 (1982)","journal-title":"Ann. Probab."},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Weinberg, S.M.: Matroid prophet inequalities. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 123\u2013136. ACM (2012)","DOI":"10.1145\/2213977.2213991"},{"key":"24_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":"24_CR28","unstructured":"Lee, E., Singla, S.: Optimal online contention resolution schemes via ex-ante prophet inequalities. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 112. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"issue":"1","key":"24_CR29","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/3144722.3144725","volume":"16","author":"B Lucier","year":"2017","unstructured":"Lucier, B.: An economic view of prophet inequalities. ACM SIGecom Exch. 16(1), 24\u201347 (2017)","journal-title":"ACM SIGecom Exch."},{"key":"24_CR30","doi-asserted-by":"crossref","unstructured":"Rubinstein, A.: Beyond matroids: secretary problem and prophet inequality with general constraints. In: Proceedings of the Forty-eighth Annual ACM Symposium on Theory of Computing, pp. 324\u2013332. ACM (2016)","DOI":"10.1145\/2897518.2897540"},{"issue":"4","key":"24_CR31","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1214\/aop\/1176993150","volume":"12","author":"E Samuel-Cahn","year":"1984","unstructured":"Samuel-Cahn, E.: Comparison of threshold stop rules and maximum for independent nonnegative random variables. Ann. Probab. 12(4), 1213\u20131216 (1984)","journal-title":"Ann. Probab."},{"key":"24_CR32","doi-asserted-by":"crossref","unstructured":"Yan, Q.: Mechanism design via correlation gap. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 710\u2013719. Society for Industrial and Applied Mathematics (2011)","DOI":"10.1137\/1.9781611973082.56"}],"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-030-04612-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:35:51Z","timestamp":1709825751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04612-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046118","9783030046125"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04612-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 November 2018","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":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ox.ac.uk\/conferences\/wine2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chiar","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","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":"28","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":"8","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":"24% - 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":"10","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}