{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T05:47:26Z","timestamp":1772171246605,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030859466","type":"print"},{"value":"9783030859473","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85947-3_15","type":"book-chapter","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:45:22Z","timestamp":1631580322000},"page":"221-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Revenue Guarantees for Pricing in Large Markets"],"prefix":"10.1007","author":[{"given":"Jos\u00e9","family":"Correa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dana","family":"Pizarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Verdugo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,14]]},"reference":[{"issue":"2","key":"15_CR1","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_CR2","doi-asserted-by":"crossref","unstructured":"Alaei, S., Fu, H., Haghpanah, N., Hartline, J.: The simple economics of approximately optimal auctions. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 628\u2013637. IEEE (2013)","DOI":"10.1109\/FOCS.2013.73"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1016\/j.geb.2018.08.003","volume":"118","author":"S Alaei","year":"2019","unstructured":"Alaei, S., Hartline, J., Niazadeh, R., Pountourakis, E., Yuan, Y.: Optimal auctions vs. anonymous pricing. Games Econ. Behav. 118, 494\u2013510 (2019)","journal-title":"Games Econ. Behav."},{"key":"15_CR4","unstructured":"Chawla, S., Devanur, N., Lykouris, T.: Static pricing for multi-unit prophet inequalities. arXiv preprint arXiv:2007.07990 (2020)"},{"key":"15_CR5","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 42th ACM Symposium on Theory of Computing, STOC 2010 (2010)","DOI":"10.1145\/1806689.1806733"},{"key":"15_CR6","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 2017 (2017)","DOI":"10.1145\/3033274.3085137"},{"issue":"1","key":"15_CR7","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":"15_CR8","unstructured":"D\u00fctting, P., Fischer, F., Klimm, M.: Revenue gaps for static and dynamic posted pricing of homogeneous goods. arXiv preprint arXiv:1607.07105 (2016)"},{"key":"15_CR9","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"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Feng, Y., Hartline, J.D., Li, Y.: Optimal auctions vs. anonymous pricing: beyond linear utility. In: Proceedings of the 2019 ACM Conference on Economics and Computation, pp. 885\u2013886 (2019)","DOI":"10.1145\/3328526.3329603"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Fisher, R.A., Tippett, L.H.C.: Limiting forms of the frequency distribution of the largest or smallest member of a sample. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol. 24, pp. 180\u2013190. Cambridge University Press (1928)","DOI":"10.1017\/S0305004100015681"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1002\/sapm195938177","volume":"38","author":"W Gautschi","year":"1959","unstructured":"Gautschi, W.: Some elementary inequalities relating to the gamma and incomplete gamma function. J. Math. Phys. 38(1), 77\u201381 (1959)","journal-title":"J. Math. Phys."},{"key":"15_CR13","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, 35\u201376 (1966)","journal-title":"J. Am. Stat. Assoc."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Gnedenko, B.: Sur la distribution limite du terme maximum d\u2019une serie aleatoire. Ann. Math. 423\u2013453 (1943)","DOI":"10.2307\/1968974"},{"key":"15_CR15","first-page":"58","volume":"7","author":"MT Hajiaghayi","year":"2007","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Sandholm, T.: Automated online mechanism design and prophet inequalities. AAAI 7, 58\u201365 (2007)","journal-title":"AAAI"},{"issue":"10","key":"15_CR16","doi-asserted-by":"publisher","first-page":"3102","DOI":"10.1257\/aer.20130712","volume":"105","author":"JD Hartline","year":"2015","unstructured":"Hartline, J.D., Lucier, B.: Non-optimal mechanism design. Am. Econ. Rev. 105(10), 3102\u201324 (2015)","journal-title":"Am. Econ. Rev."},{"issue":"2","key":"15_CR17","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":"5","key":"15_CR18","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/19M126178X","volume":"49","author":"Y Jin","year":"2020","unstructured":"Jin, Y., Lu, P., Tang, Z.G., Xiao, T.: Tight revenue gaps among simple mechanisms. SIAM J. Comput. 49(5), 927\u2013958 (2020)","journal-title":"SIAM J. Comput."},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1214\/aop\/1176990547","volume":"19","author":"DP Kennedy","year":"1991","unstructured":"Kennedy, D.P., Kertz, R.P.: The asymptotic behavior of the reward sequence in the optimal stopping of i.i.d. random variables. Ann. Probab. 19, 329\u2013341 (1991)","journal-title":"Ann. Probab."},{"key":"15_CR20","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, 88\u2013112 (1986)","journal-title":"J. Multivar. Anal."},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Weinberg, S.M.: Matroid prophet inequalities. In: Proceedings of the 44th ACM Symposium on Theory of Computing, STOC 2012 (2012)","DOI":"10.1145\/2213977.2213991"},{"key":"15_CR22","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. Amer. Math. Soc. 83, 745\u2013747 (1977)","journal-title":"Bull. Amer. Math. Soc."},{"key":"15_CR23","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."},{"key":"15_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5449-2","volume-title":"Extremes and Related Properties of Random Sequences and Processes","author":"MR Leadbetter","year":"2012","unstructured":"Leadbetter, M.R., Lindgren, G., Rootz\u00e9n, H.: Extremes and Related Properties of Random Sequences and Processes. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4612-5449-2"},{"issue":"1","key":"15_CR25","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":"15_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-75953-1","volume-title":"Extreme Values, Regular Variation and Point Processes","author":"SI Resnick","year":"2013","unstructured":"Resnick, S.I.: Extreme Values, Regular Variation and Point Processes. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-0-387-75953-1"},{"key":"15_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1006\/jmva.2000.1972","volume":"80","author":"U Saint-Mont","year":"2002","unstructured":"Saint-Mont, U.: A simple derivation of a complicated prophet region. J. Multivar. Anal. 80, 67\u201372 (2002)","journal-title":"J. Multivar. Anal."},{"issue":"4","key":"15_CR28","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":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85947-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T14:10:39Z","timestamp":1641996639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85947-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030859466","9783030859473"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85947-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","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":"sagt2021","order":10,"name":"conference_id","label":"Conference ID","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","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":"26","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":"36% - 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":"7.5","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)"}},{"value":"4 abstracts of presented papers are also included.","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)"}}]}}