{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T16:52:55Z","timestamp":1767372775091,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030304720"},{"type":"electronic","value":"9783030304737"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-30473-7_1","type":"book-chapter","created":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T23:02:36Z","timestamp":1568588556000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Optimal On-Line Allocation Rules with Verification"],"prefix":"10.1007","author":[{"given":"Markos","family":"Epitropou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rakesh","family":"Vohra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,16]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Alaei, S.: Bayesian combinatorial auctions: expanding single buyer mechanisms to many buyers. In: Proceedings of the 52nd IEEE Annual Symposium on Foundations of Computer Science, pp. 512\u2013521 (2011)","DOI":"10.1109\/FOCS.2011.90"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Alaei, S., Hajiaghayi, M., Liaghat, V.: Online prophet-inequality matching with applications to ad allocation. In: Proceedings of the 13th ACM Conference on Electronic Commerce, pp. 18\u201335 (2012)","DOI":"10.1145\/2229012.2229018"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Ball, I., Kattwinkel, D.: Probabilistic verification in mechanism design. In: Proceedings of the 20th ACM Conference on Economics and Computation, pp. 389\u2013390 (2019)","DOI":"10.1145\/3328526.3329657"},{"issue":"12","key":"1_CR4","doi-asserted-by":"publisher","first-page":"3779","DOI":"10.1257\/aer.104.12.3779","volume":"104","author":"E Ben-Porath","year":"2014","unstructured":"Ben-Porath, E., Dekel, E., Lipman, B.L.: Optimal allocation with costly verification. Am. Econ. Rev. 104(12), 3779\u20133813 (2014)","journal-title":"Am. Econ. Rev."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.2307\/2938181","volume":"59","author":"KC Border","year":"1991","unstructured":"Border, K.C.: Implementation of reduced form auctions: a geometric approach. Econometrica 59, 1175\u20131187 (1991)","journal-title":"Econometrica"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Elkind, E., Szegedy, M., Yu, L.: Mechanism design: from partial to probabilistic verification. In: Proceedings of the 13th ACM Conference on Electronic Commerce, pp. 266\u2013283 (2012)","DOI":"10.1145\/2229012.2229035"},{"key":"1_CR7","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 42nd ACM Symposium on Theory of Computing, pp. 311\u2013320 (2010)","DOI":"10.1145\/1806689.1806733"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Duetting, P., Feldman, M., Kesselheim, T., Lucier, B.: Prophet inequalities made easy: stochastic optimization by pricing non-stochastic inputs. In: 58th IEEE Annual Symposium on Foundations of Computer Science, pp. 540\u2013551 (2017)","DOI":"10.1109\/FOCS.2017.56"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, M., Svensson, O., Zenklusen, R.: A simple O(loglog(rank))-competitive algorithm for the matroid secretary problem. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1189\u20131201 (2015)","DOI":"10.1137\/1.9781611973730.79"},{"issue":"4","key":"1_CR10","doi-asserted-by":"publisher","first-page":"647","DOI":"10.2307\/2297737","volume":"52","author":"D Gale","year":"1985","unstructured":"Gale, D., Hellwig, M.: Incentive-compatible debt contracts: the one-period problem. Rev. Econ. Stud. 52(4), 647\u2013663 (1985)","journal-title":"Rev. Econ. Stud."},{"key":"1_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9780262028400.001.0001","volume-title":"Dynamic Allocation and Pricing: A Mechanism Design Approach","author":"A Gershkov","year":"2014","unstructured":"Gershkov, A., Moldovanu, B.: Dynamic Allocation and Pricing: A Mechanism Design Approach. MIT Press, Cambridge (2014)"},{"key":"1_CR12","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Sandholm, T.: Automated online mechanism design and prophet inequalities. In: Proceedings of the 22nd National Conference on Artificial Intelligence, pp. 58\u201365 (2007)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1090\/conm\/125\/1160620","volume":"125","author":"TP Hill","year":"1992","unstructured":"Hill, T.P., Kertz, R.P.: A survey of prophet inequalities in optimal stopping theory. Contemp. Math. 125, 191\u2013207 (1992)","journal-title":"Contemp. Math."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Weinberg, S.M.: Matroid prophet inequalities. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing, pp. 123\u2013136 (2012)","DOI":"10.1145\/2213977.2213991"},{"issue":"4","key":"1_CR15","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":"1_CR16","first-page":"197","volume":"4","author":"U Krengel","year":"1978","unstructured":"Krengel, U., Sucheston, L.: On semiamarts, amarts, and processes with finite value. Adv. Prob. Related Topics 4, 197\u2013266 (1978)","journal-title":"Adv. Prob. Related Topics"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Li, Y.: Mechanism design with costly verification and limited punishments. Working Paper (2019)","DOI":"10.1016\/j.jet.2020.105000"},{"issue":"1","key":"1_CR18","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. SIGecom Exch. 16(1), 24\u201347 (2017)","journal-title":"SIGecom Exch."},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"399","DOI":"10.2307\/2937855","volume":"104","author":"D Mookherjee","year":"1989","unstructured":"Mookherjee, D., Png, I.: Optimal auditing, insurance, and redistribution. Q. J. Econ. 104(2), 399\u2013415 (1989)","journal-title":"Q. J. Econ."},{"issue":"9","key":"1_CR20","doi-asserted-by":"publisher","first-page":"2666","DOI":"10.1257\/aer.20140494","volume":"107","author":"T Mylovanov","year":"2017","unstructured":"Mylovanov, T., Zapechelnyuk, A.: Optimal allocation with ex post verification and limited penalties. Am. Econ. Rev. 107(9), 2666\u201394 (2017)","journal-title":"Am. Econ. Rev."},{"issue":"4","key":"1_CR21","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."},{"issue":"2","key":"1_CR22","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0531(79)90031-0","volume":"21","author":"RM Townsend","year":"1979","unstructured":"Townsend, R.M.: Optimal contracts and competitive markets with costly state verification. J. Econ. Theor. 21(2), 265\u2013293 (1979)","journal-title":"J. Econ. Theor."},{"issue":"1","key":"1_CR23","first-page":"60","volume":"17","author":"RV Vohra","year":"2012","unstructured":"Vohra, R.V.: Dynamic mechanism design. Surv. Oper. Res. Manag. Sci. 17(1), 60\u201368 (2012)","journal-title":"Surv. Oper. Res. Manag. Sci."}],"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-30473-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T12:53:56Z","timestamp":1721739236000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30473-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304720","9783030304737"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30473-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 September 2019","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":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/corelab.ntua.gr\/sagt2019\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","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":"47% - 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","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)"}}]}}