{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:05:21Z","timestamp":1743008721374,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046118"},{"type":"electronic","value":"9783030046125"}],"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_11","type":"book-chapter","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T15:09:45Z","timestamp":1542726585000},"page":"154-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Pricing for MHR Distributions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2382-1779","authenticated-orcid":false,"given":"Yiannis","family":"Giannakopoulos","sequence":"first","affiliation":[]},{"given":"Keyu","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"issue":"2","key":"11_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":"11_CR2","doi-asserted-by":"crossref","unstructured":"Alaei, S., Hartline, J., Niazadeh, R., Pountourakis, E., Yuan, Y.: Optimal auctions vs. anonymous pricing. In: Proceedings of IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS, pp. 1446\u20131463 (2015)","DOI":"10.1109\/FOCS.2015.92"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/3037382","volume":"5","author":"M Babaioff","year":"2017","unstructured":"Babaioff, M., Blumrosen, L., Dughmi, S., Singer, Y.: Posting prices with unknown distributions. ACM Trans. Econ. Comput. 5(2), 13:1\u201313:20 (2017)","journal-title":"ACM Trans. Econ. Comput."},{"key":"11_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971194","volume-title":"Mathematical Theory of Reliability","author":"RE Barlow","year":"1996","unstructured":"Barlow, R.E., Proschan, F.: Mathematical Theory of Reliability. Society for Industrial and Applied Mathematics, Philadelphia (1996)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., Goel, G., Gollapudi, S., Munagala, K.: Budget constrained auctions with heterogeneous items. In: Proceedings of the 42nd ACM symposium on Theory of Computing, pp. 379\u2013388 (2010)","DOI":"10.1145\/1806689.1806743"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Blumrosen, L., Holenstein, T.: Posted prices vs. negotiations: an asymptotic analysis. In: Proceedings of the 9th ACM Conference on Electronic Commerce, EC, p. 49 (2008)","DOI":"10.1145\/1386790.1386801"},{"issue":"1","key":"11_CR7","first-page":"180","volume":"86","author":"J Bulow","year":"1996","unstructured":"Bulow, J., Klemperer, P.: Auctions versus negotiations. Am. Econ. Rev. 86(1), 180\u2013194 (1996)","journal-title":"Am. Econ. Rev."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Cai, Y., Daskalakis, C.: Extreme-value theorems for optimal multidimensional pricing. Proceedings of IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS, pp. 522\u2013531 (2011)","DOI":"10.1109\/FOCS.2011.76"},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/TIT.2014.2365772","volume":"61","author":"N Cesa-Bianchi","year":"2015","unstructured":"Cesa-Bianchi, N., Gentile, C., Mansour, Y.: Regret minimization for reserve prices in second-price auctions. IEEE Trans. Inf. Theory 61(1), 549\u2013564 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR10","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, STOC, pp. 311\u2013320 (2010)","DOI":"10.1145\/1806689.1806733"},{"key":"11_CR11","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 18th ACM Conference on Economics and Computation, EC, pp. 169\u2013186 (2017)","DOI":"10.1145\/3033274.3085137"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Weinberg, S.M.: Symmetries and optimal multi-dimensional mechanism design. In: Proceedings of the 13th ACM Conference on Electronic Commerce, EC, pp. 370\u2013387 (2012)","DOI":"10.1145\/2229012.2229042"},{"issue":"C","key":"11_CR13","first-page":"318","volume":"91","author":"P Dhangwatnotai","year":"2014","unstructured":"Dhangwatnotai, P., Roughgarden, T., Yan, Q.: Revenue maximization with a single sample. Games Econ. Behav. 91(C), 318\u2013333 (2014)","journal-title":"Games Econ. Behav."},{"key":"11_CR14","unstructured":"D\u00fctting, P., Fischer, F.A., Klimm, M.: Revenue gaps for discriminatory and anonymous sequential posted pricing. CoRR abs\/1607.07105 (2016). http:\/\/arxiv.org\/abs\/1607.07105v1"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Fu, H., Immorlica, N., Lucier, B., Strack, P.: Randomization beats second price as a prior-independent auction. In: Proceedings of the 16th ACM Conference on Economics and Computation, EC, p. 323 (2015)","DOI":"10.1145\/2764468.2764489"},{"key":"11_CR16","unstructured":"Giannakopoulos, Y., Koutsoupias, E., Lazos, P.: Online market intermediation. In: Chatzigiannakis, I., Indyk, P., Kuhn, F., Muscholl, A. (eds.) 44th International Colloquium on Automata, Languages, and Programming, ICALP. LIPIcs, vol. 80, pp. 47:1\u201347:14 (2017)"},{"issue":"4","key":"11_CR17","doi-asserted-by":"publisher","first-page":"19:1","DOI":"10.1145\/3105968","volume":"5","author":"Y Giannakopoulos","year":"2017","unstructured":"Giannakopoulos, Y., Kyropoulou, M.: The VCG mechanism for Bayesian scheduling. ACM Trans. Econ. Comput. 5(4), 19:1\u201319:16 (2017)","journal-title":"ACM Trans. Econ. Comput."},{"key":"11_CR18","unstructured":"Giannakopoulos, Y., Zhu, K.: Optimal pricing for MHR distributions. CoRR abs\/1810.00800, October 2018. http:\/\/arxiv.org\/pdf\/1810.00800.pdf"},{"key":"11_CR19","unstructured":"Hajiaghayi, M.T., Kleinberg, R.D., Sandholm, T.: Automated online mechanism design and prophet inequalities. In: Proceedings of the 22nd Conference on Artificial Intelligence, AAAI (2007)"},{"key":"11_CR20","unstructured":"Hartline, J.D.: Mechanism design and approximation, Chap. 4, Manuscript (2017). http:\/\/jasonhartline.com\/MDnA\/"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Roughgarden, T.: Simple versus optimal mechanisms. In: Proceedings of the 10th ACM Conference on Electronic Commerce, EC, pp. 225\u2013234 (2009)","DOI":"10.1145\/1566374.1566407"},{"key":"11_CR22","unstructured":"Jin, Y., Lu, P., Tang, Z.G., Xiao, T.: Tight revenue gaps among simple mechanisms. CoRR abs\/1804.00480, April 2018. http:\/\/arxiv.org\/abs\/1804.00480"},{"key":"11_CR23","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, STOC, pp. 123\u2013136 (2012)","DOI":"10.1145\/2213977.2213991"},{"issue":"1","key":"11_CR24","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":"11_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N.: Introduction to mechanism design (for computer scientists), Chap. 9. In: Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V. (eds.) Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1137\/1.9781611973082.56","volume-title":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Qiqi Yan","year":"2011","unstructured":"Yan, Q.: Mechanism design via correlation gap. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 710\u2013719 (2011)"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:34:21Z","timestamp":1709825661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04612-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046118","9783030046125"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04612-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}