{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T17:45:28Z","timestamp":1779212728656,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,8,3]],"date-time":"2020-08-03T00:00:00Z","timestamp":1596412800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,3]],"date-time":"2020-08-03T00:00:00Z","timestamp":1596412800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10107-020-01544-8","type":"journal-article","created":{"date-parts":[[2020,8,3]],"date-time":"2020-08-03T13:22:47Z","timestamp":1596460967000},"page":"483-521","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Prophet secretary through blind strategies"],"prefix":"10.1007","volume":"190","author":[{"given":"Jose","family":"Correa","sequence":"first","affiliation":[]},{"given":"Raimundo","family":"Saona","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4448-1411","authenticated-orcid":false,"given":"Bruno","family":"Ziliotto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,3]]},"reference":[{"key":"1544_CR1","unstructured":"Abolhassani, M., Ehsani, S., Esfandiari, H., Hajiaghayi, M.T., Kleinberg, R., Lucier, B.: In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC, pp. 61\u201371 (2017)"},{"key":"1544_CR2","doi-asserted-by":"crossref","unstructured":"Alaei, S., Hartline, J., Niazadeh, R., Pountourakis, E., Yuan, Y.: Optimal auctions vs. anonymous pricing. In: Proceedings of the 56th Annual Symposium on Foundations of Computer Science, FOCS, pp. 1446\u20131463 (2015)","DOI":"10.1109\/FOCS.2015.92"},{"key":"1544_CR3","doi-asserted-by":"crossref","unstructured":"Azar, Y., Chiplunkar, A., Kaplan, H.: Prophet secretary: surpassing the $$1-1\/e$$ barrier. In: Proceedings of the ACM Conference on Economics and Computation, EC, pp. 303\u2013318 (2018)","DOI":"10.1145\/3219166.3219182"},{"key":"1544_CR4","doi-asserted-by":"crossref","unstructured":"Azar, Y., Kleinberg, R., Weinberg, M.: Prophet inequalities with limited information. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete algorithms, SODA, pp. 1358\u20131377 (2014)","DOI":"10.1137\/1.9781611973402.100"},{"key":"1544_CR5","unstructured":"Beyhaghi, H., Golrezaei, N., Paes Leme, R., Pal, M., Sivan, B.: Improved approximations for posted price and second price mechanisms. CoRR arXiv:1807.03435 (2018)"},{"key":"1544_CR6","doi-asserted-by":"crossref","unstructured":"Correa, J., Duetting, P., Fischer, F., Schewior, K.: Prophet inequalities for iid random variables from an unknown distribution. In: Proceedings of the 20th ACM Conference on Economics and Computation, EC, pp. 3\u201317 (2019)","DOI":"10.1145\/3328526.3329627"},{"key":"1544_CR7","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J., Malec, D.L., Sivan, B.: Multi-parameter mechanism design and sequential posted pricing. In: Proceedings of the 42nd Annual ACM SIGACT Symposium on Theory of Computing, STOC, pp. 311\u2013320 (2010)","DOI":"10.1145\/1806689.1806733"},{"key":"1544_CR8","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 ACM Conference on Economics and Computation, EC, pp. 169\u2013186 (2017)","DOI":"10.1145\/3033274.3085137"},{"issue":"1","key":"1544_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.orl.2018.11.010","volume":"47","author":"J Correa","year":"2019","unstructured":"Correa, J., Foncea, P., Pizarro, D., Verdugo, V.: From pricing to prophets and back!. Oper. Res. Lett. 47(1), 25\u201329 (2019)","journal-title":"Oper. Res. Lett."},{"key":"1544_CR10","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Kesselheim, T., Lucier, B.: An O(log log m) prophet inequality for subadditive combinatorial auctions. CoRR arXiv:2004.09784 (2020)","DOI":"10.1109\/FOCS46700.2020.00037"},{"issue":"3","key":"1544_CR11","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/20M1323850","volume":"49","author":"P D\u00fctting","year":"2020","unstructured":"D\u00fctting, 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."},{"issue":"1","key":"1544_CR12","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1086\/695529","volume":"126","author":"L Einav","year":"2018","unstructured":"Einav, L., Farronato, C., Levin, J., Sundaresan, N.: Auctions versus posted prices in online markets. J. Polit. Econ. 126(1), 178\u2013215 (2018)","journal-title":"J. Polit. Econ."},{"key":"1544_CR13","doi-asserted-by":"crossref","unstructured":"Esfandiari, H., Hajiaghayi, M., Liaghat, V., Monemizadeh, M.: Prophet secretary. In: Proceedings of the 23rd Annual European Symposium, ESA, pp. 496\u2013508 (2015)","DOI":"10.1007\/978-3-662-48350-3_42"},{"key":"1544_CR14","doi-asserted-by":"crossref","unstructured":"Ehsani, S., Hajiaghayi, M., Kesselheim, T., Singla, S.: Prophet secretary for combinatorial auctions and matroids. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 700\u2013714 (2018)","DOI":"10.1137\/1.9781611975031.46"},{"key":"1544_CR15","unstructured":"Ehsani, S., Hajiaghayi, M., Kesselheim, T., Singla, S.: Combinatorial auctions via posted prices. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 123\u2013135 (2014)"},{"key":"1544_CR16","doi-asserted-by":"crossref","unstructured":"Ezra, T., Feldman, M., Gravin, N., Tang, Z.: Online stochastic max-weight matching: prophet inequality for vertex and edge arrival models. In: Proceedings of the ACM Conference on Economics and Computation, EC, 2020, to appear","DOI":"10.1145\/3391403.3399513"},{"key":"1544_CR17","doi-asserted-by":"crossref","unstructured":"Feldman, M., Gravin, N., Lucier, B.: Combinatorial auctions via posted prices. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 123\u2013135 (2015)","DOI":"10.1137\/1.9781611973730.10"},{"issue":"313","key":"1544_CR18","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/01621459.1966.10502008","volume":"61","author":"JP Gilbert","year":"1966","unstructured":"Gilbert, J.P., Mosteller, F.: Recognizing the maximum of a sequence. J. Am. Stat. Assoc. 61(313), 35\u201376 (1966)","journal-title":"J. Am. Stat. Assoc."},{"key":"1544_CR19","doi-asserted-by":"crossref","unstructured":"Gravin, N., Wang, H.: Prophet inequality for bipartite matching: merits of being simple and non adaptive. In: Proceedings of the ACM Conference on Economics and Computation, EC, pp. 93\u2013109 (2019)","DOI":"10.1145\/3328526.3329604"},{"key":"1544_CR20","unstructured":"Hajiaghayi, M., Kleinberg, R., Sandholm, T.: Automated online mechanism design and prophet inequalities. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence, AAAI, pp. 58\u201365 (2007)"},{"issue":"2","key":"1544_CR21","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 i.i.d. random variables. Ann. Probab. 10(2), 336\u2013345 (1982)","journal-title":"Ann. Probab."},{"issue":"1","key":"1544_CR22","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0047-259X(86)90095-3","volume":"19","author":"RP Kertz","year":"1986","unstructured":"Kertz, R.P.: Stop rule and supremum expectations of i.i.d. random variables: a complete comparison by conjugate duality. J. Multivar. Anal. 19(1), 88\u2013112 (1986)","journal-title":"J. Multivar. Anal."},{"key":"1544_CR23","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Weinberg, S.M.: Matroid prophet inequalities. In: Proceedings of the 44th Annual ACM SIGACT Symposium on Theory of Computing, STOC, pp. 123\u2013136 (2012)","DOI":"10.1145\/2213977.2213991"},{"key":"1544_CR24","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":"1544_CR25","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":"1544_CR26","first-page":"197","volume":"4","author":"U Krengel","year":"1978","unstructured":"Krengel, U., Sucheston, L.: On semiamarts, amarts, and processes with finite value. Adv. Probab. 4, 197\u2013266 (1978)","journal-title":"Adv. Probab."},{"issue":"1","key":"1544_CR27","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"RB Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal auction design. Math. Oper. Res. 6(1), 58\u201373 (1981)","journal-title":"Math. Oper. Res."},{"key":"1544_CR28","volume-title":"Convex Functions, Partial Orderings, and Statistical Applications","author":"J Pecaric","year":"1992","unstructured":"Pecaric, J., Proshman, F., Tong, Y.: Convex Functions, Partial Orderings, and Statistical Applications. Academic Press, Cambridge (1992)"},{"key":"1544_CR29","unstructured":"Rubinstein, A., Wang, J.Z., Weinberg, S.M.: The prophet inequality can be solved optimally with a single set of samples. In: Proceedings of the 11th Innovations in Theoretical Computer Science Conference, ITCS, pp. 60:1\u201360:10 (2020)"},{"issue":"4","key":"1544_CR30","first-page":"1213","volume":"12","author":"E Samuel-Cahn","year":"1983","unstructured":"Samuel-Cahn, E.: Comparisons of threshold stop rule and maximum for independent nonnegative random variables. Ann. Probab. 12(4), 1213\u20131216 (1983)","journal-title":"Ann. Probab."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01544-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01544-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01544-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T02:54:41Z","timestamp":1633834481000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01544-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,3]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["1544"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01544-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,3]]},"assertion":[{"value":"11 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}