{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T00:21:17Z","timestamp":1781223677057,"version":"3.54.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030946753","type":"print"},{"value":"9783030946760","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-94676-0_5","type":"book-chapter","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T16:03:08Z","timestamp":1642694588000},"page":"76-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Welfare-Preserving $$\\varepsilon $$-BIC to BIC Transformation with Negligible Revenue Loss"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Conitzer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhe","family":"Feng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David C.","family":"Parkes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Sodomka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,1,20]]},"reference":[{"issue":"1","key":"5_CR1","first-page":"81","volume":"86","author":"EM Azevedo","year":"2019","unstructured":"Azevedo, E.M., Budish, E.: Strategy-proofness in the Large. Rev. Econ. Stud. 86(1), 81\u2013116 (2019)","journal-title":"Rev. Econ. Stud."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Balcan, M., Sandholm, T., Vitercik, E.: Estimating approximate incentive compatibility. In: Proceedings of the 2019 ACM Conference on Economics and Computation, EC 2019, 867p (2019)","DOI":"10.1145\/3328526.3329628"},{"issue":"12","key":"5_CR3","doi-asserted-by":"publisher","first-page":"2886","DOI":"10.1287\/mnsc.2014.2017","volume":"60","author":"SR Balseiro","year":"2014","unstructured":"Balseiro, S.R., Feldman, J., Mirrokni, V., Muthukrishnan, S.: Yield optimization of display advertising with ad exchange. Manage. Sci. 60(12), 2886\u20132907 (2014)","journal-title":"Manage. Sci."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Bei, X., Huang, Z.: Bayesian incentive compatibility via fractional assignments. In: Proceedings of the 2011 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 720\u2013733 (2011)","DOI":"10.1137\/1.9781611973082.57"},{"issue":"4","key":"5_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(4), 1175\u20131187 (1991)","journal-title":"Econometrica"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Cai, Y., Daskalakis, C., Weinberg, M.S.: Optimal multi-dimensional mechanism design: reducing revenue to welfare maximization. In: Proceedings of the 53rd IEEE Symposium on Foundations of Computer Science, pp. 130\u2013139 (2012)","DOI":"10.1109\/FOCS.2012.88"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Cai, Y., Daskalakis, C., Weinberg, S.M.: An algorithmic characterization of multi-dimensional mechanisms. In: Proceedings of the 44th ACM Symposium on Theory of Computing (2012)","DOI":"10.1145\/2213977.2214021"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Cai, Y., Daskalakis, C., Weinberg, S.M.: Understanding incentives: mechanism design becomes algorithm design. In: Proceedings of the 54th IEEE Symposium on Foundations of Computer Science, pp. 618\u2013627 (2013)","DOI":"10.1109\/FOCS.2013.72"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Cai, Y., Oikonomou, A., Velegkas, G., Zhao, M.: An efficient $$\\varepsilon $$-BIC to BIC transformation and its application to black-box reduction in revenue maximization. In: Proceedings of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2021)","DOI":"10.1137\/1.9781611976465.81"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Cai, Y., Zhao, M.: Simple mechanisms for subadditive buyers via duality. In: Proceedings of the 49th ACM Symposium on Theory of Computing, pp. 170\u2013183 (2017)","DOI":"10.1145\/3055399.3055465"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"661","DOI":"10.3982\/ECTA9454","volume":"80","author":"G Carroll","year":"2012","unstructured":"Carroll, G.: When are local incentive constraints sufficient? Econometrica 80(2), 661\u2013686 (2012)","journal-title":"Econometrica"},{"key":"5_CR12","unstructured":"Conitzer, V., Sandholm, T.: Complexity of mechanism design. In: Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence, pp. 103\u2013110 (2002)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T.: Self-interested automated mechanism design and implications for optimal combinatorial auctions. In: Proceedings of the 5th ACM Conference on Electronic Commerce, pp. 132\u2013141 (2004)","DOI":"10.1145\/988772.988793"},{"key":"5_CR14","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, pp. 370\u2013387 (2012)","DOI":"10.1145\/2229012.2229042"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-642-31585-5_44","volume-title":"Automata, Languages, and Programming","author":"I Diakonikolas","year":"2012","unstructured":"Diakonikolas, I., Papadimitriou, C., Pierrakos, G., Singer, Y.: Efficiency-revenue trade-offs in auctions. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 488\u2013499. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31585-5_44"},{"key":"5_CR16","unstructured":"Duetting, P., Feng, Z., Narasimhan, H., Parkes, D., Ravindranath, S.S.: Optimal auctions through deep learning. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 97. PMLR, Long Beach, California, USA, 9\u201315 June 2019"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Hartline, J.D., Kleinberg, R., Niazadeh, R.: Bernoulli factories and black-box reductions in mechanism design. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (2017)","DOI":"10.1145\/3055399.3055492"},{"issue":"1","key":"5_CR18","first-page":"5","volume":"3","author":"P D\u00fctting","year":"2014","unstructured":"D\u00fctting, P., Fischer, F., Jirapinyo, P., Lai, J., Lubin, B., Parkes, D.C.: Payment rules through discriminant-based classifiers. ACM Trans. Econ. Comput. 3(1), 5 (2014)","journal-title":"ACM Trans. Econ. Comput."},{"key":"5_CR19","unstructured":"Feng, Z., Narasimhan, H., Parkes, D.C.: Deep learning for revenue-optimal auctions with budgets. In: Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems, pp. 354\u2013362 (2018)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Feng, Z., Schrijvers, O., Sodomka, E.: Online learning for measuring incentive compatibility in ad auctions. In: The World Wide Web Conference, WWW 2019, pp. 2729\u20132735 (2019)","DOI":"10.1145\/3308558.3313674"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Kleinberg, R., Malekian, A.: Bayesian incentive compatibility via matchings. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (2011)","DOI":"10.1137\/1.9781611973082.58"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Lucier, B.: Bayesian algorithmic mechanism design. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing (2010)","DOI":"10.1145\/1807406.1807425"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1016\/j.jet.2018.08.002","volume":"177","author":"T Hashimoto","year":"2018","unstructured":"Hashimoto, T.: The generalized random priority mechanism with budgets. J. Econ. Theory 177, 708\u2013733 (2018)","journal-title":"J. Econ. Theory"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Lahaie, S., Medina, A.M., Sivan, B., Vassilvitskii, S.: Testing incentive compatibility in display ad auctions. In: Proceedings of the 27th International World Wide Web Conference (WWW) (2018)","DOI":"10.1145\/3178876.3186047"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Lahaie, S., Pennock, D.M.: Revenue analysis of a family of ranking rules for keyword auctions. In: Proceedings of the 8th ACM Conference on Electronic Commerce (EC), pp. 50\u201356 (2007)","DOI":"10.1145\/1250910.1250918"},{"issue":"9","key":"5_CR26","first-page":"1021","volume":"103","author":"B Lubin","year":"2012","unstructured":"Lubin, B., Parkes, D.C.: Approximate strategyproofness. Curr. Sci. 103(9), 1021\u20131032 (2012)","journal-title":"Curr. Sci."},{"key":"5_CR27","unstructured":"Narasimhan, H., Parkes, D.C.: A general statistical framework for designing strategy-proof assignment mechanisms. In: Proceedings of the Conference on Uncertainty in Artificial Intelligence (2016)"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3105448","volume":"6","author":"A Rubinstein","year":"2018","unstructured":"Rubinstein, A., Weinberg, M.S.: Simple mechanisms for a subadditive buyer and applications to revenue monotonicity. ACM Trans. Econ. Comput. 6, 1\u201325 (2018)","journal-title":"ACM Trans. Econ. Comput."}],"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-94676-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T21:26:08Z","timestamp":1651181168000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94676-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030946753","9783030946760"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94676-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"20 January 2022","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":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"14 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/hpi.de\/wine2021\/","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":"146","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":"41","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":"28% - 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.07","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)"}},{"value":"The conference was held online due to the COVID-19 pandemic","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)"}}]}}