{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:08:05Z","timestamp":1743109685551,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030649456"},{"type":"electronic","value":"9783030649463"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-64946-3_14","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"191-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revenue Monotonicity Under Misspecified Bidders"],"prefix":"10.1007","author":[{"given":"Makis","family":"Arsenis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Odysseas","family":"Drosis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Kleinberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Azar, P., Micali, S., Daskalakis, C., Weinberg, S.M.: Optimal and efficient parametric auctions. In: SODA, pp. 596\u2013604 (2013)","DOI":"10.1137\/1.9781611973105.43"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Azar, P.D., Micali, S.: Parametric digital auctions. In: ITCS 2013, pp. 231\u2013232. ACM, New York (2013)","DOI":"10.1145\/2422436.2422464"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Bei, X., Gravin, N., Lu, P., Tang, Z.G.: Correlation-robust analysis of single item auction. In: SODA, pp. 193\u2013208. SIAM (2019)","DOI":"10.1137\/1.9781611975482.13"},{"issue":"6","key":"14_CR4","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1111\/j.1468-0262.2005.00638.x","volume":"73","author":"D Bergemann","year":"2005","unstructured":"Bergemann, D., Morris, S.: Robust mechanism design. Econometrica 73(6), 1771\u20131813 (2005)","journal-title":"Econometrica"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1561\/0700000057","volume":"8","author":"D Bergemann","year":"2013","unstructured":"Bergemann, D., Morris, S.: An introduction to robust mechanism design. Found. Trends\u00ae Microecon. 8(3), 169\u2013230 (2013)","journal-title":"Found. Trends\u00ae Microecon."},{"issue":"6","key":"14_CR6","doi-asserted-by":"publisher","first-page":"2527","DOI":"10.1016\/j.jet.2011.10.018","volume":"146","author":"D Bergemann","year":"2011","unstructured":"Bergemann, D., Schlag, K.: Robust monopoly pricing. J. Econ. Theory 146(6), 2527\u20132543 (2011)","journal-title":"J. Econ. Theory"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1006\/jagm.1995.1034","volume":"19","author":"A Blum","year":"1995","unstructured":"Blum, A., Spencer, J.H.: Coloring random and semi-random k-colorable graphs. J. Algorithms 19, 204\u2013234 (1995)","journal-title":"J. Algorithms"},{"key":"14_CR8","unstructured":"Bradac, D., Gupta, A., Singla, S., Zuzic, G.: Robust algorithms for the secretary problem. In: ITCS (2019)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Brustle, J., Cai, Y., Daskalakis, C.: Multi-item mechanisms without item-independence: learnability via robustness. In: EC 2020, pp. 715\u2013761. ACM, New York (2020)","DOI":"10.1145\/3391403.3399541"},{"key":"14_CR10","unstructured":"Bubeck, S., Devanur, N., Huang, Z., Niazadeh, R.: Multi-scale online learning: theory and applications to online auctions and pricing. J. Mach. Learn. Res. 20, 1\u201337 (2019). https:\/\/www.jmlr.org\/papers\/v20\/17-498.bib"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Cai, Y., Daskalakis, C.: Learning multi-item auctions with (or without) samples. In: FOCS, pp. 516\u2013527. IEEE (2017)","DOI":"10.1109\/FOCS.2017.54"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.jet.2018.05.005","volume":"177","author":"V Carrasco","year":"2018","unstructured":"Carrasco, V., Farinha Luz, V., Kos, N., Messner, M., Monteiro, P., Moreira, H.: Optimal selling mechanisms under moment conditions. J. Econ. Theory 177, 245\u2013279 (2018)","journal-title":"J. Econ. Theory"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"453","DOI":"10.3982\/ECTA14165","volume":"85","author":"G Carroll","year":"2017","unstructured":"Carroll, G.: Robustness and separation in multidimensional screening. Econometrica 85(2), 453\u2013488 (2017)","journal-title":"Econometrica"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-99660-8_5","volume-title":"Algorithmic Game Theory","author":"J Chen","year":"2018","unstructured":"Chen, J., Li, B., Li, Y.: Information elicitation for Bayesian auctions. In: Deng, X. (ed.) SAGT 2018. LNCS, vol. 11059, pp. 43\u201355. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99660-8_5"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Cole, R., Roughgarden, T.: The sample complexity of revenue maximization. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, pp. 243\u2013252 (2014)","DOI":"10.1145\/2591796.2591867"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Devanur, N., Huang, Z., Psomas, C.A.: The sample complexity of auctions with side information. In: STOC, pp. 426\u2013439 (2016)","DOI":"10.1145\/2897518.2897553"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.geb.2014.03.011","volume":"91","author":"P Dhangwatnotai","year":"2015","unstructured":"Dhangwatnotai, P., Roughgarden, T., Yan, Q.: Revenue maximization with a single sample. Games Econ. Behav. 91, 318\u2013333 (2015)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1137\/17M1126680","volume":"48","author":"I Diakonikolas","year":"2019","unstructured":"Diakonikolas, I., Kamath, G., Kane, D., Li, J., Moitra, A., Stewart, A.: Robust estimators in high-dimensions without the computational intractability. SIAM J. Comput. 48(2), 742\u2013864 (2019)","journal-title":"SIAM J. Comput."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Roughgarden, T., Sundararajan, M.: Revenue submodularity. In: EC 2009, pp. 243\u2013252. Association for Computing Machinery, New York (2009)","DOI":"10.1145\/1566374.1566409"},{"issue":"4","key":"14_CR20","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1006\/jcss.2001.1773","volume":"63","author":"U Feige","year":"2001","unstructured":"Feige, U., Kilian, J.: Heuristics for semirandom graph problems. J. Comput. Syst. Sci. 63(4), 639\u2013671 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.geb.2006.02.003","volume":"55","author":"AV Goldberg","year":"2006","unstructured":"Goldberg, A.V., Hartline, J.D., Karlin, A.R., Saks, M., Wright, A.: Competitive auctions. Games Econ. Behav. 55(2), 242\u2013269 (2006). Mini Special Issue: Electronic Market Design","journal-title":"Games Econ. Behav."},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Gravin, N., Lu, P.: Separation in correlation-robust monopolist problem with budget. In: SODA, pp. 2069\u20132080. SIAM (2018)","DOI":"10.1137\/1.9781611975031.135"},{"key":"14_CR23","unstructured":"Hartline, J.D.: Mechanism design and approximation. http:\/\/jasonhartline.com\/MDnA\/MDnA-ch3.pdf. Accessed 13 July 2020"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Roughgarden, T.: Simple versus optimal mechanisms. In: EC (2009)","DOI":"10.1145\/1566374.1566407"},{"issue":"3","key":"14_CR25","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1137\/16M1065719","volume":"47","author":"Z Huang","year":"2018","unstructured":"Huang, Z., Mansour, Y., Roughgarden, T.: Making the most of your samples. SIAM J. Comput. 47(3), 651\u2013674 (2018)","journal-title":"SIAM J. Comput."},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Lai, K.A., Rao, A.B., Vempala, S.: Agnostic estimation of mean and covariance. In: FOCS, pp. 665\u2013674. IEEE (2016)","DOI":"10.1109\/FOCS.2016.76"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Lykouris, T., Mirrokni, V., Paes Leme, R.: Stochastic bandits robust to adversarial corruptions. In: STOC, pp. 114\u2013122 (2018)","DOI":"10.1145\/3188745.3188918"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Makarychev, K., Makarychev, Y., Vijayaraghavan, A.: Approximation algorithms for semi-random partitioning problems. In: STOC, pp. 367\u2013384 (2012)","DOI":"10.1145\/2213977.2214013"},{"key":"14_CR29","unstructured":"Morgenstern, J., Roughgarden, T.: Learning simple auctions. In: CoLT (2016)"},{"issue":"1","key":"14_CR30","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":"14_CR31","volume-title":"Matroid Theory (Oxford Graduate Texts in Mathematics)","author":"JG Oxley","year":"2006","unstructured":"Oxley, J.G.: Matroid Theory (Oxford Graduate Texts in Mathematics). Oxford University Press Inc., Oxford (2006)"},{"issue":"1","key":"14_CR32","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/1345037.1345048","volume":"7","author":"B Rastegari","year":"2007","unstructured":"Rastegari, B., Condon, A., Leyton-Brown, K.: Revenue monotonicity in combinatorial auctions. SIGecom Exch. 7(1), 45\u201347 (2007)","journal-title":"SIGecom Exch."},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Roth, A., S\u00f6nmez, T., Unver, U.: Pairwise kidney exchange. In: Game Theory and Information. University Library of Munich, Germany (2005)","DOI":"10.3386\/w10698"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Wilson, R.: Game-theoretic analyses of trading processes. In: Econometric Society Monographs, pp. 33\u201370. Cambridge University Press (1987)","DOI":"10.1017\/CCOL0521340446.002"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64946-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:09:42Z","timestamp":1607159382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","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":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/econcs.pku.edu.cn\/wine2020\/","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":"136","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":"31","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":"11","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":"23% - 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)"}}]}}