{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T04:59:45Z","timestamp":1775278785921,"version":"3.50.1"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046118","type":"print"},{"value":"9783030046125","type":"electronic"}],"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_7","type":"book-chapter","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T10:09:45Z","timestamp":1542708585000},"page":"96-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Simple Mechanism for a Budget-Constrained Buyer"],"prefix":"10.1007","author":[{"given":"Yu","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Nick","family":"Gravin","sequence":"additional","affiliation":[]},{"given":"Kamesh","family":"Munagala","sequence":"additional","affiliation":[]},{"given":"Kangning","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Abrams, Z.: Revenue maximization when bidders have budgets. In: Proceedings of 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 1074\u20131082 (2006)","DOI":"10.1145\/1109557.1109676"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Alaei, S., Fu, H., Haghpanah, N., Hartline, J.D., Malekian, A.: Bayesian optimal auctions via multi- to single-agent reduction. In: Proceedings of 13th ACM Conference on Electronic Commerce, p. 17 (2012)","DOI":"10.1145\/2229012.2229017"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Gonczarowski, Y.A., Nisan, N.: The menu-size complexity of revenue approximation. In: Proceedings of 49th ACM Symposium on Theory of Computing, pp. 869\u2013877 (2017)","DOI":"10.1145\/3055399.3055426"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Immorlica, N., Lucier, B., Weinberg, S.M.: A simple and approximately optimal mechanism for an additive buyer. In: Proceedings of 55th IEEE Symposium on Foundations of Computer Science, pp. 21\u201330 (2014)","DOI":"10.1109\/FOCS.2014.11"},{"issue":"311","key":"7_CR5","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1080\/01621459.1965.10480836","volume":"60","author":"RE Barlow","year":"1965","unstructured":"Barlow, R.E., Marshall, A.W.: Tables of bounds for distributions with monotone hazard rate. J. Am. Stat. Assoc. 60(311), 872\u2013890 (1965)","journal-title":"J. Am. Stat. Assoc."},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-662-48350-3_9","volume-title":"Algorithms - ESA 2015","author":"MH Bateni","year":"2015","unstructured":"Bateni, M.H., Dehghani, S., Hajiaghayi, M.T., Seddighin, S.: Revenue maximization for selling multiple correlated items. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 95\u2013105. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_9"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Gravin, N., Lu, P.: Budget feasible mechanism design: from prior-free to Bayesian. In: Proceedings of 44th ACM Symposium on Theory of Computing, pp. 449\u2013458 (2012)","DOI":"10.1145\/2213977.2214020"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1137\/1.9781611973075.47","volume-title":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Sayan Bhattacharya","year":"2010","unstructured":"Bhattacharya, S., Conitzer, V., Munagala, K., Xia, L.: Incentive compatible budget elicitation in multi-unit auctions. In: Proceedings of 21st ACM-SIAM Symposium on Discrete Algorithms, pp. 554\u2013572 (2010)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., Goel, G., Gollapudi, S., Munagala, K.: Budget constrained auctions with heterogeneous items. In: Proceedings of 42nd ACM Symposium on Theory of Computing, pp. 379\u2013388 (2010)","DOI":"10.1145\/1806689.1806743"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Borgs, C., Chayes, J.T., Immorlica, N., Mahdian, M., Saberi, A.: Multi-unit auctions with budget-constrained bidders. In: Proceedings of 6th ACM Conference on Electronic Commerce, pp. 44\u201351 (2005)","DOI":"10.1145\/1064009.1064014"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1137\/1.9781611973075.49","volume-title":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Patrick Briest","year":"2010","unstructured":"Briest, P., Chawla, S., Kleinberg, R., Weinberg, S.M.: Pricing randomized allocations. In: Proceedings of 21st ACM-SIAM Symposium on Discrete Algorithms, pp. 585\u2013597 (2010)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Cai, Y., Daskalakis, C., Weinberg, S.M.: An algorithmic characterization of multi-dimensional mechanisms. In: Proceedings of 44th ACM Symposium on Theory of Computing, pp. 459\u2013478 (2012)","DOI":"10.1145\/2213977.2214021"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Cai, Y., Daskalakis, C., Weinberg, S.M.: Optimal multi-dimensional mechanism design: reducing revenue to welfare maximization. In: Proceedings of 53rd IEEE Symposium on Foundations of Computer Science, pp. 130\u2013139 (2012)","DOI":"10.1109\/FOCS.2012.88"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1137\/1.9781611973105.42","volume-title":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Yang Cai","year":"2013","unstructured":"Cai, Y., Daskalakis, C., Weinberg, S.M.: Reducing revenue to welfare maximization: approximation algorithms and other generalizations. In: Proceedings of 24th ACM-SIAM Symposium on Discrete Algorithms, pp. 578\u2013595 (2013)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Cai, Y., Daskalakis, C., Weinberg, S.M.: Understanding incentives: mechanism design becomes algorithm design. In: Proceedings of 54th IEEE Symposium on Foundations of Computer Science, pp. 618\u2013627 (2013)","DOI":"10.1109\/FOCS.2013.72"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Cai, Y., Devanur, N.R., Weinberg, S.M.: A duality based unified approach to Bayesian mechanism design. In: Proceedings of 48th ACM Symposium on Theory of Computing, pp. 926\u2013939 (2016)","DOI":"10.1145\/2897518.2897645"},{"issue":"2","key":"7_CR17","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"},{"issue":"6","key":"7_CR18","doi-asserted-by":"publisher","first-page":"2189","DOI":"10.1137\/080735503","volume":"39","author":"D Chakrabarty","year":"2010","unstructured":"Chakrabarty, D., Goel, G.: On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP. SIAM J. Comput. 39(6), 2189\u20132211 (2010)","journal-title":"SIAM J. Comput."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J.D., Kleinberg, R.D.: Algorithmic pricing via virtual valuations. In: Proceedings of 8th ACM Conference on Electronic Commerce, pp. 243\u2013251 (2007)","DOI":"10.1145\/1250910.1250946"},{"key":"7_CR20","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 42nd ACM Symposium on Theory of Computing, pp. 311\u2013320 (2010)","DOI":"10.1145\/1806689.1806733"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Chawla, S., Malec, D.L., Malekian, A.: Bayesian mechanism design for budget-constrained agents. In: Proceedings of 12th ACM Conference on Electronic Commerce, pp. 253\u2013262 (2011)","DOI":"10.1145\/1993574.1993613"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.geb.2012.08.010","volume":"91","author":"S Chawla","year":"2015","unstructured":"Chawla, S., Malec, D.L., Sivan, B.: The power of randomness in Bayesian optimal mechanism design. Games Econ. Behav. 91, 297\u2013317 (2015)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1006\/jeth.1999.2639","volume":"92","author":"Y Che","year":"2000","unstructured":"Che, Y., Gale, I.L.: The optimal mechanism for selling to a budget-constrained buyer. J. Econ. Theory 92(2), 198\u2013233 (2000)","journal-title":"J. Econ. Theory"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1137\/1.9781611973082.54","volume-title":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Ning Chen","year":"2011","unstructured":"Chen, N., Gravin, N., Lu, P.: On the approximability of budget feasible mechanisms. In: Proceedings of 22nd ACM-SIAM Symposium on Discrete Algorithms, pp. 685\u2013699 (2011)"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Cheung, H.Y., Dughmi, S., Emamjomeh-Zadeh, E., Han, L., Teng, S.: Mixture selection, mechanism design, and signaling. In: Proceedings of 56th IEEE Symposium on Foundations of Computer Science, pp. 1426\u20131445 (2015)","DOI":"10.1109\/FOCS.2015.91"},{"issue":"1","key":"7_CR26","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/2845926.2845928","volume":"14","author":"C Daskalakis","year":"2015","unstructured":"Daskalakis, C.: Multi-item auctions defying intuition? SIGecom Exch. 14(1), 41\u201375 (2015)","journal-title":"SIGecom Exch."},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Deckelbaum, A., Tzamos, C.: Mechanism design via optimal transport. In: Proceedings of 14th ACM Conference on Electronic Commerce, pp. 269\u2013286 (2013)","DOI":"10.1145\/2482540.2482593"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Devanur, N.R., Weinberg, S.M.: Revenue maximization and ex-post budget constraints. In: Proceedings of 16th ACM Conference on Economics and Computation, pp. 433\u2013447 (2015)","DOI":"10.1145\/2764468.2764521"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Ha, B.Q., Hartline, J.D.: Prior-free auctions for budgeted agents. In: Proceedings of 14th ACM Conference on Electronic Commerce, pp. 287\u2013304 (2013)","DOI":"10.1145\/2482540.2482554"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Weinberg, S.M.: The optimal mechanism for selling to a budget constrained buyer: the general case. In: Proceedings of 18th ACM Conference on Economics and Computation, pp. 39\u201340 (2017)","DOI":"10.1145\/3033274.3085132"},{"issue":"2","key":"7_CR31","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/j.geb.2011.08.003","volume":"74","author":"S Dobzinski","year":"2012","unstructured":"Dobzinski, S., Lavi, R., Nisan, N.: Multi-unit auctions with budget limits. Games Econ. Behav. 74(2), 486\u2013503 (2012)","journal-title":"Games Econ. Behav."},{"key":"7_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-319-13129-0_22","volume-title":"Web and Internet Economics","author":"S Dughmi","year":"2014","unstructured":"Dughmi, S., Han, L., Nisan, N.: Sampling and representation complexity of revenue maximization. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 277\u2013291. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_22"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Eden, A., Feldman, M., Friedler, O., Talgam-Cohen, I., Weinberg, S.M.: A simple and approximately optimal mechanism for a buyer with complements. In: Proceedings of 18th ACM Conference on Economics and Computation, p. 323 (2017)","DOI":"10.1145\/3033274.3085116"},{"issue":"3","key":"7_CR34","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/2757277","volume":"62","author":"G Goel","year":"2015","unstructured":"Goel, G., Mirrokni, V.S., Leme, R.P.: Polyhedral clinching auctions and the adwords polytope. J. ACM 62(3), 18:1\u201318:27 (2015)","journal-title":"J. ACM"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Hartline, J.D., Wright, A.: Competitive auctions and digital goods. In: Proceedings of 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 735\u2013744 (2001)","DOI":"10.1007\/3-540-44676-1_35"},{"key":"7_CR36","doi-asserted-by":"publisher","first-page":"2069","DOI":"10.1137\/1.9781611975031.135","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Nick Gravin","year":"2018","unstructured":"Gravin, N., Lu, P.: Separation in correlation-robust monopolist problem with budget. In: Proceedings of 29th ACM-SIAM Symposium on Discrete Algorithms, pp. 2069\u20132080 (2018)"},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Hart, S., Nisan, N.: Approximate revenue maximization with multiple items. In: Proceedings of 13th ACM Conference on Electronic Commerce, p. 656 (2012)","DOI":"10.1145\/2229012.2229061"},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Hart, S., Nisan, N.: The menu-size complexity of auctions. In: Proceedings of 14th ACM Conference on Electronic Commerce, pp. 565\u2013566 (2013)","DOI":"10.1145\/2482540.2482544"},{"key":"7_CR39","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.jet.2017.09.001","volume":"172","author":"S Hart","year":"2017","unstructured":"Hart, S., Nisan, N.: Approximate revenue maximization with multiple items. J. Econ. Theory 172, 313\u2013347 (2017)","journal-title":"J. Econ. Theory"},{"issue":"2","key":"7_CR40","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0165-1765(96)00849-X","volume":"52","author":"J-J Laffont","year":"1996","unstructured":"Laffont, J.-J., Robert, J.: Optimal auction with financially constrained buyers. Econ. Lett. 52(2), 181\u2013186 (1996)","journal-title":"Econ. Lett."},{"issue":"28","key":"7_CR41","doi-asserted-by":"publisher","first-page":"11232","DOI":"10.1073\/pnas.1309533110","volume":"110","author":"X Li","year":"2013","unstructured":"Li, X., Yao, A.C.: On revenue maximization for selling multiple independently distributed items. Proc. Natl. Acad. Sci. 110(28), 11232\u201311237 (2013)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1","key":"7_CR42","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.jet.2006.12.007","volume":"137","author":"AM Manelli","year":"2007","unstructured":"Manelli, A.M., Vincent, D.R.: Multidimensional mechanism design: revenue maximization and the multiple-good monopoly. J. Econ. Theory 137(1), 153\u2013185 (2007)","journal-title":"J. Econ. Theory"},{"issue":"1","key":"7_CR43","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":"7_CR44","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.jet.2013.09.015","volume":"150","author":"MM Pai","year":"2014","unstructured":"Pai, M.M., Vohra, R.: Optimal auctions with financially constrained buyers. J. Econ. Theory 150, 383\u2013425 (2014)","journal-title":"J. Econ. Theory"},{"key":"7_CR45","doi-asserted-by":"crossref","unstructured":"Rubinstein, A., Weinberg, S.M.: Simple mechanisms for a subadditive buyer and applications to revenue monotonicity. In: Proceedings of 16th ACM Conference on Economics and Computation, pp. 377\u2013394 (2015)","DOI":"10.1145\/2764468.2764510"},{"key":"7_CR46","doi-asserted-by":"crossref","unstructured":"Singer, Y.: Budget feasible mechanisms. In: Proceedings of 51st IEEE Symposium on Foundations of Computer Science, pp. 765\u2013774 (2010)","DOI":"10.1109\/FOCS.2010.78"},{"key":"7_CR47","doi-asserted-by":"crossref","unstructured":"Singla, A., Krause, A.: Truthful incentives in crowdsourcing tasks using regret minimization mechanisms. In: WWW, pp. 1167\u20131178 (2013)","DOI":"10.1145\/2488388.2488490"},{"key":"7_CR48","first-page":"54","volume":"69","author":"P Tang","year":"2017","unstructured":"Tang, P., Wang, Z.: Optimal mechanisms with simple menus. J. Econ. Theory 69, 54\u201370 (2017)","journal-title":"J. Econ. Theory"},{"key":"7_CR49","first-page":"92","volume-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Andrew Chi-Chih Yao","year":"2014","unstructured":"Yao, A.C.: An n-to-1 bidder reduction for multi-item auctions and its applications. In: Proceedings of 26th ACM-SIAM Symposium on Discrete Algorithms, pp. 92\u2013109 (2015)"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T04:15:20Z","timestamp":1775276120000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04612-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046118","9783030046125"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04612-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}