{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T21:30:16Z","timestamp":1758403816863,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"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_13","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"177-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Robust Revenue Maximization Under Minimal Statistical Information"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2382-1779","authenticated-orcid":false,"given":"Yiannis","family":"Giannakopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5474-3614","authenticated-orcid":false,"given":"Diogo","family":"Po\u00e7as","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandros","family":"Tsigonias-Dimitriadis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Azar, P., Daskalakis, C., Micali, S., Weinberg, S.M.: Optimal and efficient parametric auctions. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 596\u2013604 (2013). https:\/\/doi.org\/10.1137\/1.9781611973105.43","DOI":"10.1137\/1.9781611973105.43"},{"key":"13_CR2","unstructured":"Azar, P., Micali, S.: Optimal parametric auctions. Technical report, MIT-CSAIL-TR-2012-015 (2012). http:\/\/hdl.handle.net\/1721.1\/70556"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Azar, P.D., Micali, S.: Parametric digital auctions. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science (ITCS), pp. 231\u2013232 (2013). https:\/\/doi.org\/10.1145\/2422436.2422464","DOI":"10.1145\/2422436.2422464"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Babaioff, M., Immorlica, N., Lucier, B., Weinberg, S.M.: A simple and approximately optimal mechanism for an additive buyer. In: Proceedings of the 55th Annual Symposium on Foundations of Computer Science (FOCS), pp. 21\u201330 (2014). https:\/\/doi.org\/10.1109\/FOCS.2014.11","DOI":"10.1109\/FOCS.2014.11"},{"issue":"4","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1287\/moor.2014.0645","volume":"39","author":"C Bandi","year":"2014","unstructured":"Bandi, C., Bertsimas, D.: Optimal design for multi-item auctions: a robust optimization approach. Math. Oper. Res. 39(4), 1012\u20131038 (2014). https:\/\/doi.org\/10.1287\/moor.2014.0645","journal-title":"Math. Oper. Res."},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Bei, X., Gravin, N., Lu, P., Tang, Z.G.: Correlation-robust analysis of single item auction. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 193\u2013208 (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.13","DOI":"10.1137\/1.9781611975482.13"},{"issue":"6","key":"13_CR7","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). https:\/\/doi.org\/10.1016\/j.jet.2011.10.018","journal-title":"J. Econ. Theory"},{"key":"13_CR8","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"1","key":"13_CR9","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":"13_CR10","doi-asserted-by":"publisher","unstructured":"Cai, Y., Daskalakis, C.: Learning multi-item auctions with (or without) samples. In: Proceedings of the 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 516\u2013527 (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.54","DOI":"10.1109\/FOCS.2017.54"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Cai, Y., Devanur, N.R., Weinberg, S.M.: A duality based unified approach to Bayesian mechanism design. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 926\u2013939. ACM Press (2016). https:\/\/doi.org\/10.1145\/2897518.2897645","DOI":"10.1145\/2897518.2897645"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Cai, Y., Zhao, M.: Simple mechanisms for subadditive buyers via duality. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 170\u2013183 (2017). https:\/\/doi.org\/10.1145\/3055399.3055465","DOI":"10.1145\/3055399.3055465"},{"key":"13_CR13","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., Luz, V.F., Kos, N., Messner, M., Monteiro, P., Moreira, H.: Optimal selling mechanisms under moment conditions. J. Econ. Theory 177, 245\u2013279 (2018). https:\/\/doi.org\/10.1016\/j.jet.2018.05.005","journal-title":"J. Econ. Theory"},{"issue":"2","key":"13_CR14","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). https:\/\/doi.org\/10.3982\/ECTA14165","journal-title":"Econometrica"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1146\/annurev-economics-080218-025616","volume":"11","author":"G Carroll","year":"2019","unstructured":"Carroll, G.: Robustness in mechanism design and contracting. Annu. Rev. Econ. 11(1), 139\u2013166 (2019). https:\/\/doi.org\/10.1146\/annurev-economics-080218-025616","journal-title":"Annu. Rev. Econ."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Chawla, S., Fu, H., Karlin, A.R.: Approximate revenue maximization in interdependent value settings. CoRR abs\/1408.4424 (2014)","DOI":"10.1145\/2600057.2602858"},{"key":"13_CR17","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/1806689.1806733","DOI":"10.1145\/1806689.1806733"},{"key":"13_CR18","unstructured":"Chen, J., Li, B., Li, Y., Lu, P.: Bayesian auctions with efficient queries. CoRR abs\/1804.07451 (2018)"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Chen, X., Diakonikolas, I., Orfanou, A., Paparas, D., Sun, X., Yannakakis, M.: On the complexity of optimal lottery pricing and randomized mechanisms. In: Proceedings of 56th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1464\u20131479 (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.93","DOI":"10.1109\/FOCS.2015.93"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Chen, X., Matikas, G., Paparas, D., Yannakakis, M.: On the complexity of simple and optimal deterministic mechanisms for an additive buyer. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2036\u20132049 (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.133","DOI":"10.1137\/1.9781611975031.133"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Daskalakis, C., Deckelbaum, A., Tzamos, C.: The complexity of optimal mechanism design. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1302\u20131318 (2013). https:\/\/doi.org\/10.1137\/1.9781611973402.96","DOI":"10.1137\/1.9781611973402.96"},{"issue":"3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"735","DOI":"10.3982\/ECTA12618","volume":"85","author":"C Daskalakis","year":"2017","unstructured":"Daskalakis, C., Deckelbaum, A., Tzamos, C.: Strong duality for a multiple-good monopolist. Econometrica 85(3), 735\u2013767 (2017). https:\/\/doi.org\/10.3982\/ECTA12618","journal-title":"Econometrica"},{"issue":"C","key":"13_CR23","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":"13_CR24","doi-asserted-by":"publisher","unstructured":"D\u00fctting, P., Roughgarden, T., Talgam-Cohen, I.: Simple versus optimal contracts. In: Proceedings of the 20th ACM Conference on Economics and Computation (EC), pp. 369\u2013387 (2019). https:\/\/doi.org\/10.1145\/3328526.3329591","DOI":"10.1145\/3328526.3329591"},{"key":"13_CR25","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/2764468.2764489","DOI":"10.1145\/2764468.2764489"},{"issue":"1","key":"13_CR26","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1137\/16M1072218","volume":"47","author":"Y Giannakopoulos","year":"2018","unstructured":"Giannakopoulos, Y., Koutsoupias, E.: Duality and optimality of auctions for uniform distributions. SIAM J. Comput. 47(1), 121\u2013165 (2018). https:\/\/doi.org\/10.1137\/16M1072218","journal-title":"SIAM J. Comput."},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Giannakopoulos, Y., Po\u00e7as, D., Tsigonias-Dimitriadis, A.: Robust revenue maximization under minimal statistical information. CoRR abs\/1907.04220 (2019)","DOI":"10.1007\/978-3-030-64946-3_13"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Gravin, N., Lu, P.: Separation in correlation-robust monopolist problem with budget. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2069\u20132080 (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.135","DOI":"10.1137\/1.9781611975031.135"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Haghpanah, N., Hartline, J.: Reverse mechanism design. In: Proceedings of the 16th ACM Conference on Economics and Computation (EC), pp. 757\u2013758 (2015). https:\/\/doi.org\/10.1145\/2764468.2764498","DOI":"10.1145\/2764468.2764498"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Hart, S., Nisan, N.: The menu-size complexity of auctions. In: Proceedings of the 14th ACM Conference on Electronic Commerce (EC), pp. 565\u2013566 (2013). https:\/\/doi.org\/10.1145\/2482540.2482544","DOI":"10.1145\/2482540.2482544"},{"key":"13_CR31","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). https:\/\/doi.org\/10.1016\/j.jet.2017.09.001","journal-title":"J. Econ. Theory"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Hartline, J.D.: Mechanism design and approximation (2013), manuscript. http:\/\/jasonhartline.com\/MDnA\/","DOI":"10.1561\/9781601986719"},{"key":"13_CR33","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/1566374.1566407","DOI":"10.1145\/1566374.1566407"},{"key":"13_CR34","volume-title":"The Advanced Theory of Statistics","author":"MG Kendall","year":"1948","unstructured":"Kendall, M.G.: The Advanced Theory of Statistics, vol. I, 4th edn. Charles Griffin, Glasgow (1948)","edition":"4"},{"issue":"28","key":"13_CR35","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.C.: On revenue maximization for selling multiple independently distributed items. Proc. Nat. Acad. Sci. 110(28), 11232\u201311237 (2013). https:\/\/doi.org\/10.1073\/pnas.1309533110","journal-title":"Proc. Nat. Acad. Sci."},{"key":"13_CR36","unstructured":"Li, Y., Lu, P., Ye, H.: Revenue maximization with imprecise distribution. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), pp. 1582\u20131590 (2019). http:\/\/dl.acm.org\/citation.cfm?id=3306127.3331877"},{"issue":"1","key":"13_CR37","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). https:\/\/doi.org\/10.1016\/j.jet.2006.12.007","journal-title":"J. Econ. Theory"},{"key":"13_CR38","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813825.009","volume-title":"Putting Auction Theory to Work","author":"P Milgrom","year":"2004","unstructured":"Milgrom, P.: Putting Auction Theory to Work. Cambridge University Press, Cambridge (2004). https:\/\/doi.org\/10.1017\/CBO9780511813825.009"},{"key":"13_CR39","volume-title":"Introduction to the Theory of Statistics","author":"AM Mood","year":"1974","unstructured":"Mood, A.M., Graybill, F.A., Boes, D.C.: Introduction to the Theory of Statistics, 3rd edn. McGraw-Hill, New York (1974)","edition":"3"},{"issue":"4","key":"13_CR40","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1214\/aoms\/1177729542","volume":"22","author":"S Moriguti","year":"1951","unstructured":"Moriguti, S.: Extremal properties of extreme value distributions. Ann. Math. Stat. 22(4), 523\u2013536 (1951)","journal-title":"Ann. Math. Stat."},{"key":"13_CR41","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"1","key":"13_CR42","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). https:\/\/doi.org\/10.1287\/moor.6.1.58","journal-title":"Math. Oper. Res."},{"issue":"1","key":"13_CR43","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1146\/annurev-economics-080218-025607","volume":"11","author":"T Roughgarden","year":"2019","unstructured":"Roughgarden, T., Talgam-Cohen, I.: Approximately optimal mechanism design. Annu. Rev. Econ. 11(1), 355\u2013381 (2019). https:\/\/doi.org\/10.1146\/annurev-economics-080218-025607","journal-title":"Annu. Rev. Econ."},{"issue":"3\u20134","key":"13_CR44","doi-asserted-by":"publisher","first-page":"19:1","DOI":"10.1145\/3105448","volume":"6","author":"A Rubinstein","year":"2018","unstructured":"Rubinstein, A., Weinberg, S.M.: Simple mechanisms for a subadditive buyer and applications to revenue monotonicity. ACM Trans. Econ. Comput. 6(3\u20134), 19:1\u201319:25 (2018). https:\/\/doi.org\/10.1145\/3105448","journal-title":"ACM Trans. Econ. Comput."},{"key":"13_CR45","doi-asserted-by":"publisher","unstructured":"Wilson, R.: Game-theoretic analyses of trading processes. In: Advances in Economic Theory: Fifth World Congress, pp. 33\u201370. Econometric Society Monographs, Cambridge University Press (1987). https:\/\/doi.org\/10.1017\/CCOL0521340446.002","DOI":"10.1017\/CCOL0521340446.002"},{"key":"13_CR46","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: An $$n$$-to-$$1$$ bidder reduction for multi-item auctions and its applications. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 92\u2013109 (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.8","DOI":"10.1137\/1.9781611973730.8"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T17:19:23Z","timestamp":1697303963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_13","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)"}}]}}