{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:24:42Z","timestamp":1777519482159,"version":"3.51.4"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031331695","type":"print"},{"value":"9783031331701","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33170-1_6","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:55:27Z","timestamp":1685710527000},"page":"86-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Strategy Synthesis in Markov Decision Processes Under Limited Sampling Access"],"prefix":"10.1007","author":[{"given":"Christel","family":"Baier","sequence":"first","affiliation":[]},{"given":"Clemens","family":"Dubslaff","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Wienh\u00f6ft","sequence":"additional","affiliation":[]},{"given":"Stefan J.","family":"Kiebel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"6_CR1","unstructured":"https:\/\/osf.io\/r24mu\/?view_only=b44cec578cce44e5920f150940f68230"},{"key":"6_CR2","unstructured":"Amin, S., Gomrokchi, M., Satija, H., van Hoof, H., Precup, D.: A survey of exploration methods in reinforcement learning (2021)"},{"key":"6_CR3","volume-title":"Learning and Memory: An Integrated Approach","author":"JR Anderson","year":"2000","unstructured":"Anderson, J.R.: Learning and Memory: An Integrated Approach, 2nd edn. Wiley, Hoboken (2000)","edition":"2"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-030-25540-4_29","volume-title":"Computer Aided Verification","author":"P Ashok","year":"2019","unstructured":"Ashok, P., K\u0159et\u00ednsk\u00fd, J., Weininger, M.: PAC statistical model checking for Markov decision processes and stochastic games. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 497\u2013519. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_29"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2004","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47, 235\u2013256 (2004)","journal-title":"Mach. Learn."},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-319-63387-9_8","volume-title":"Computer Aided Verification","author":"C Baier","year":"2017","unstructured":"Baier, C., Klein, J., Leuschner, L., Parker, D., Wunderlich, S.: Ensuring the reliability of your model checker: interval iteration for Markov decision processes. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 160\u2013180. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_8"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Baier, C., Cuevas Rivera, D., Dubslaff, C., Kiebel, S.J.: Human-Inspired Models for Tactile Computing, chap. 8, pp. 173\u2013200. Academic Press (2021)","DOI":"10.1016\/B978-0-12-821343-8.00019-8"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-030-61362-4_13","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles","author":"C Baier","year":"2020","unstructured":"Baier, C., Dubslaff, C., Hermanns, H., Klauck, M., Kl\u00fcppelholz, S., K\u00f6hl, M.A.: Components in probabilistic systems: suitable by construction. In: Margaria, T., Steffen, B. (eds.) ISoLA 2020. LNCS, vol. 12476, pp. 240\u2013261. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61362-4_13"},{"key":"6_CR9","unstructured":"Baier, C., Dubslaff, C., Wienh\u00f6ft, P., Kiebel, S.J.: Strategy synthesis in Markov decision processes under limited sampling access. Extended Version (2023). https:\/\/arxiv.org\/abs\/2303.12718"},{"issue":"1\u20132","key":"6_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(94)00011-O","volume":"72","author":"AG Barto","year":"1995","unstructured":"Barto, A.G., Bradtke, S.J., Singh, S.P.: Learning to act using real-time dynamic programming. Artif. Intell. 72(1\u20132), 81\u2013138 (1995)","journal-title":"Artif. Intell."},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1287\/moor.16.3.580","volume":"16","author":"DP Bertsekas","year":"1991","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: An analysis of stochastic shortest path problems. Math. Oper. Res. 16(3), 580\u2013595 (1991). https:\/\/doi.org\/10.1287\/moor.16.3.580","journal-title":"Math. Oper. Res."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1162\/153244303765208377","volume":"3","author":"RI Brafman","year":"2003","unstructured":"Brafman, R.I., Tennenholtz, M.: R-max - a general polynomial time algorithm for near-optimal reinforcement learning. J. Mach. Learn. Res. 3, 213\u2013231 (2003). https:\/\/doi.org\/10.1162\/153244303765208377","journal-title":"J. Mach. Learn. Res."},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-319-11936-6_8","volume-title":"Automated Technology for Verification and Analysis","author":"T Br\u00e1zdil","year":"2014","unstructured":"Br\u00e1zdil, T., et al.: Verification of Markov decision processes using learning algorithms. In: Cassez, F., Raskin, J.-F. (eds.) ATVA 2014. LNCS, vol. 8837, pp. 98\u2013114. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11936-6_8"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-78499-9_22","volume-title":"Foundations of Software Science and Computational Structures","author":"K Chatterjee","year":"2008","unstructured":"Chatterjee, K., Sen, K., Henzinger, T.A.: Model-checking $$\\mathit{\\omega }$$-regular properties of interval Markov chains. In: Amadio, R. (ed.) FoSSaCS 2008. LNCS, vol. 4962, pp. 302\u2013317. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78499-9_22"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Daca, P., Henzinger, T.A., K\u0159et\u00ednsk\u00fd, J., Petrov, T.: Faster statistical model checking for unbounded temporal properties (2016)","DOI":"10.1007\/978-3-662-49674-9_7"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3060139","volume":"18","author":"P Daca","year":"2017","unstructured":"Daca, P., Henzinger, T.A., K\u0159et\u00ednsk\u00fd, J., Petrov, T.: Faster statistical model checking for unbounded temporal properties. ACM Trans. Comput. Logic 18(2), 1\u201325 (2017). https:\/\/doi.org\/10.1145\/3060139","journal-title":"ACM Trans. Comput. Logic"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0004-3702(00)00047-3","volume":"122","author":"R Givan","year":"2000","unstructured":"Givan, R., Leach, S., Dean, T.: Bounded-parameter Markov decision processes. Artif. Intell. 122(1), 71\u2013109 (2000). https:\/\/doi.org\/10.1016\/S0004-3702(00)00047-3","journal-title":"Artif. Intell."},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-030-50086-3_6","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"TP Gros","year":"2020","unstructured":"Gros, T.P., Hermanns, H., Hoffmann, J., Klauck, M., Steinmetz, M.: Deep statistical model checking. In: Gotsman, A., Sokolova, A. (eds.) FORTE 2020. LNCS, vol. 12136, pp. 96\u2013114. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50086-3_6"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.tcs.2016.12.003","volume":"735","author":"S Haddad","year":"2018","unstructured":"Haddad, S., Monmege, B.: Interval iteration algorithm for MDPs and IMDPs. Theoret. Comput. Sci. 735, 111\u2013131 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2016.12.003","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"He, R., Jennings, P., Basu, S., Ghosh, A., Wu, H.: A bounded statistical approach for model checking of unbounded until properties, pp. 225\u2013234 (2010)","DOI":"10.1145\/1858996.1859043"},{"issue":"301","key":"6_CR21","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"issue":"4","key":"6_CR22","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/S0893-6080(02)00056-4","volume":"15","author":"S Ishii","year":"2002","unstructured":"Ishii, S., Yoshida, W., Yoshimoto, J.: Control of exploitation-exploration meta-parameter in reinforcement learning. Neural Netw. 15(4), 665\u2013687 (2002). https:\/\/doi.org\/10.1016\/S0893-6080(02)00056-4","journal-title":"Neural Netw."},{"issue":"51","key":"6_CR23","first-page":"1563","volume":"11","author":"T Jaksch","year":"2010","unstructured":"Jaksch, T., Ortner, R., Auer, P.: Near-optimal regret bounds for reinforcement learning. J. Mach. Learn. Res. 11(51), 1563\u20131600 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"6_CR24","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4168.001.0001","volume-title":"Learning in Embedded Systems","author":"LP Kaelbling","year":"1993","unstructured":"Kaelbling, L.P.: Learning in Embedded Systems. The MIT Press, Cambridge (1993). https:\/\/doi.org\/10.7551\/mitpress\/4168.001.0001"},{"issue":"1","key":"6_CR25","first-page":"237","volume":"4","author":"LP Kaelbling","year":"1996","unstructured":"Kaelbling, L.P., Littman, M.L., Moore, A.W.: Reinforcement learning: a survey. J. Artif. Int. Res. 4(1), 237\u2013285 (1996)","journal-title":"J. Artif. Int. Res."},{"key":"6_CR26","unstructured":"Kallenberg, L.: Lecture Notes Markov Decision Problems - version 2020 (2020)"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1023\/A:1017984413808","volume":"49","author":"M Kearns","year":"2002","unstructured":"Kearns, M., Singh, S.: Near-optimal reinforcement learning in polynomial time. Mach. Learn. 49, 209\u2013232 (2002). https:\/\/doi.org\/10.1023\/A:1017984413808","journal-title":"Mach. Learn."},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-319-91908-9_23","volume-title":"Computing and Software Science","author":"A Legay","year":"2019","unstructured":"Legay, A., Lukina, A., Traonouez, L.M., Yang, J., Smolka, S.A., Grosu, R.: Statistical model checking. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 478\u2013504. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91908-9_23"},{"key":"6_CR29","volume-title":"Machine Learning","author":"T Mitchell","year":"1997","unstructured":"Mitchell, T.: Machine Learning. McGraw Hill, New York (1997)"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Pineda, L.E., Zilberstein, S.: Planning under uncertainty using reduced models: revisiting determinization. In: ICAPS (2014)","DOI":"10.1609\/icaps.v24i1.13636"},{"key":"6_CR31","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"M Puterman","year":"1994","unstructured":"Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, Hoboken (1994)"},{"key":"6_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmp.2020.102472","volume":"100","author":"S Schwoebel","year":"2021","unstructured":"Schwoebel, S., Markovic, D., Smolka, M.N., Kiebel, S.J.: Balancing control: a Bayesian interpretation of habitual and goal-directed behavior. J. Math. Psychol. 100, 102472 (2021). https:\/\/doi.org\/10.1016\/j.jmp.2020.102472","journal-title":"J. Math. Psychol."},{"key":"6_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/11691372_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Sen","year":"2006","unstructured":"Sen, K., Viswanathan, M., Agha, G.: Model-checking Markov chains in the presence of uncertainties. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 394\u2013410. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11691372_26"},{"key":"6_CR34","doi-asserted-by":"publisher","unstructured":"Strehl, A., Littman, M.: An empirical evaluation of interval estimation for Markov decision processes, pp. 128\u2013135 (2004). https:\/\/doi.org\/10.1109\/ICTAI.2004.28","DOI":"10.1109\/ICTAI.2004.28"},{"key":"6_CR35","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1016\/j.jcss.2007.08.009","volume":"74","author":"A Strehl","year":"2008","unstructured":"Strehl, A., Littman, M.: An analysis of model-based interval estimation for Markov decision processes. J. Comput. Syst. Sci. 74, 1309\u20131331 (2008). https:\/\/doi.org\/10.1016\/j.jcss.2007.08.009","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR36","unstructured":"Suilen, M., Sim\u00e3o, T., Jansen, N., Parker, D.: Robust anytime learning of Markov decision processes. In: Proceedings of NeurIPS (2022)"},{"issue":"4","key":"6_CR37","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1145\/122344.122377","volume":"2","author":"RS Sutton","year":"1991","unstructured":"Sutton, R.S.: Dyna, an integrated architecture for learning, planning, and reacting. SIGART Bull. 2(4), 160\u2013163 (1991). https:\/\/doi.org\/10.1145\/122344.122377","journal-title":"SIGART Bull."},{"key":"6_CR38","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction, 2nd edn. The MIT Press, Cambridge (2018)","edition":"2"},{"key":"6_CR39","unstructured":"Thrun, S.B., M\u00f6ller, K.: Active exploration in dynamic environments. In: Moody, J., Hanson, S., Lippmann, R.P. (eds.) Advances in Neural Information Processing Systems, vol. 4. Morgan-Kaufmann (1992)"},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00992698","volume":"8","author":"CJCH Watkins","year":"1992","unstructured":"Watkins, C.J.C.H., Dayan, P.: Q-learning. Mach. Learn. 8, 279\u2013292 (1992). https:\/\/doi.org\/10.1007\/BF00992698","journal-title":"Mach. Learn."},{"issue":"4","key":"6_CR41","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1214\/aoap\/1177005588","volume":"2","author":"R Weber","year":"1992","unstructured":"Weber, R.: On the Gittins index for multiarmed bandits. Ann. Appl. Probab. 2(4), 1024\u20131033 (1992). https:\/\/doi.org\/10.1214\/aoap\/1177005588","journal-title":"Ann. Appl. Probab."},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Wiering, M., Schmidhuber, J.: Efficient model-based exploration. In: Proceedings of the Sixth Intercational Conference on Simulation of Adaptive Behaviour: From Animals to Animats 6, pp. 223\u2013228. MIT Press\/Bradford Books (1998)","DOI":"10.7551\/mitpress\/3119.003.0034"},{"issue":"1","key":"6_CR43","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1146\/annurev-psych-122414-033417","volume":"67","author":"W Wood","year":"2016","unstructured":"Wood, W., R\u00fcnger, D.: Psychology of habit. Annu. Rev. Psychol. 67(1), 289\u2013314 (2016). https:\/\/doi.org\/10.1146\/annurev-psych-122414-033417","journal-title":"Annu. Rev. Psychol."},{"issue":"8","key":"6_CR44","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/j.artint.2007.12.002","volume":"172","author":"D Wu","year":"2008","unstructured":"Wu, D., Koutsoukos, X.: Reachability analysis of uncertain systems using bounded-parameter Markov decision processes. Artif. Intell. 172(8), 945\u2013954 (2008). https:\/\/doi.org\/10.1016\/j.artint.2007.12.002","journal-title":"Artif. Intell."},{"key":"6_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-19829-8_10","volume-title":"Formal Methods: Foundations and Applications","author":"HLS Younes","year":"2011","unstructured":"Younes, H.L.S., Clarke, E.M., Zuliani, P.: Statistical verification of probabilistic properties with unbounded until. In: Davies, J., Silva, L., Simao, A. (eds.) SBMF 2010. LNCS, vol. 6527, pp. 144\u2013160. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19829-8_10"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33170-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T15:59:40Z","timestamp":1702569580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33170-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331695","9783031331701"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33170-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Houston, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/nfm-2023","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":"75","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":"26","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":"3","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":"35% - 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.9","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":"6","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)"}}]}}