{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:18:10Z","timestamp":1743146290309,"version":"3.40.3"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031432637"},{"type":"electronic","value":"9783031432644"}],"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-43264-4_23","type":"book-chapter","created":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T23:03:02Z","timestamp":1694041382000},"page":"363-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pretty Good Strategies and\u00a0Where to\u00a0Find Them"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Jamroga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damian","family":"Kurpiewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"23_CR1","unstructured":"Alur, R., et al.: MOCHA: modularity in model checking. Technical report, University of Berkeley (2000)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pp. 100\u2013109. IEEE Computer Society Press (1997)","DOI":"10.1109\/SFCS.1997.646098"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49, 672\u2013713 (2002). https:\/\/doi.org\/10.1145\/585265.585270","journal-title":"J. ACM"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1016\/j.ic.2018.02.022","volume":"261","author":"B Aminof","year":"2018","unstructured":"Aminof, B., Malvone, V., Murano, A., Rubin, S.: Graded modalities in strategy logic. Inf. Comput. 261, 634\u2013649 (2018). https:\/\/doi.org\/10.1016\/j.ic.2018.02.022","journal-title":"Inf. Comput."},{"key":"23_CR5","unstructured":"Belardinelli, F., Condurache, R., Dima, C., Jamroga, W., Jones, A.: Bisimulations for verification of strategic abilities with application to ThreeBallot voting protocol. In: Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 1286\u20131295. IFAAMAS (2017)"},{"key":"23_CR6","unstructured":"Belardinelli, F., Lomuscio, A.: Agent-based abstractions for verifying alternating-time temporal logic with imperfect information. In: Proceedings of AAMAS, pp. 1259\u20131267. ACM (2017)"},{"key":"23_CR7","doi-asserted-by":"publisher","unstructured":"Berthon, R., Maubert, B., Murano, A., Rubin, S., Vardi, M.Y.: Strategy logic with imperfect information. In: Proceedings of LICS, pp. 1\u201312 (2017). https:\/\/doi.org\/10.1109\/LICS.2017.8005136","DOI":"10.1109\/LICS.2017.8005136"},{"key":"23_CR8","doi-asserted-by":"publisher","unstructured":"Berthon, R., Maubert, B., Murano, A., Rubin, S., Vardi, M.Y.: Strategy logic with imperfect information. ACM Trans. Comput. Log. 22(1), 5:1\u20135:51 (2021). https:\/\/doi.org\/10.1145\/3427955","DOI":"10.1145\/3427955"},{"issue":"8","key":"23_CR9","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-1-4419-6984-2_5","volume-title":"Specification and Verification of Multi-agent Systems","author":"N Bulling","year":"2010","unstructured":"Bulling, N., Dix, J., Jamroga, W.: Model checking logics of strategic ability: complexity. In: Dastani, M., Hindriks, K., Meyer, J.J. (eds.) Specification and Verification of Multi-agent Systems, pp. 125\u2013159. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-6984-2_5"},{"issue":"1\u20133","key":"23_CR11","first-page":"81","volume":"93","author":"N Bulling","year":"2009","unstructured":"Bulling, N., Jamroga, W.: What agents can probably enforce. Fund. Inform. 93(1\u20133), 81\u201396 (2009)","journal-title":"Fund. Inform."},{"key":"23_CR12","unstructured":"Bulling, N., Jamroga, W.: Alternating epistemic mu-calculus. In: Proceedings of IJCAI-11, pp. 109\u2013114 (2011)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 10-20 states and beyond. In: Proceedings of 4th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 428\u2013439. IEEE Computer Society (1990)","DOI":"10.1109\/LICS.1990.113767"},{"key":"23_CR14","unstructured":"Busard, S.: Symbolic model checking of multi-modal logics: uniform strategies and rich explanations. Ph.D. thesis, Universite Catholique de Louvain (2017)"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-319-11737-9_3","volume-title":"Formal Methods and Software Engineering","author":"S Busard","year":"2014","unstructured":"Busard, S., Pecheur, C., Qu, H., Raimondi, F.: Improving the model checking of strategies under partial observability and fairness constraints. In: Merz, S., Pang, J. (eds.) ICFEM 2014. LNCS, vol. 8829, pp. 27\u201342. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11737-9_3"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.ic.2015.03.014","volume":"242","author":"S Busard","year":"2015","unstructured":"Busard, S., Pecheur, C., Qu, H., Raimondi, F.: Reasoning about memoryless strategies under partial observability and unconditional fairness constraints. Inf. Comput. 242, 128\u2013156 (2015). https:\/\/doi.org\/10.1016\/j.ic.2015.03.014","journal-title":"Inf. Comput."},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-14977-1_12","volume-title":"Computational Logic in Multi-Agent Systems","author":"J Calta","year":"2010","unstructured":"Calta, J., Shkatov, D., Schlingloff, H.: Finding uniform strategies for multi-agent systems. In: Dix, J., Leite, J., Governatori, G., Jamroga, W. (eds.) CLIMA 2010. LNCS (LNAI), vol. 6245, pp. 135\u2013152. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14977-1_12"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-319-08867-9_34","volume-title":"Computer Aided Verification","author":"P \u010cerm\u00e1k","year":"2014","unstructured":"\u010cerm\u00e1k, P., Lomuscio, A., Mogavero, F., Murano, A.: MCMAS-SLK: a model checker for the verification of strategy logic specifications. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 525\u2013532. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_34"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Cerm\u00e1k, P., Lomuscio, A., Murano, A.: Verifying and synthesising multi-agent systems against one-goal strategy logic specifications. In: Proceedings of AAAI, pp. 2038\u20132044 (2015)","DOI":"10.1609\/aaai.v29i1.9444"},{"issue":"3","key":"23_CR20","first-page":"4","volume":"3","author":"K Chatterjee","year":"2007","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T., Raskin, J.F.: Algorithms for omega-regular games of incomplete information. Log. Methods Comput. Sci. 3(3), 4 (2007)","journal-title":"Log. Methods Comput. Sci."},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/bfb0025774","volume-title":"Logic of Programs 1981","author":"E Clarke","year":"1981","unstructured":"Clarke, E., Emerson, E.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. Lecture Notes in Computer Science, vol. 131, pp. 52\u201371. Springer, Cham (1981). https:\/\/doi.org\/10.1007\/bfb0025774"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-36577-X_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P Dembi\u0144ski","year":"2003","unstructured":"Dembi\u0144ski, P., et al.: $$\\surd $$erics: a tool for verifying timed automata and estelle specifications. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 278\u2013283. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36577-X_20"},{"key":"23_CR23","unstructured":"Dima, C., Maubert, B., Pinchinat, S.: The expressive power of epistemic $$\\mu $$-calculus. CoRR abs\/1407.5166 (2014)"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-662-48057-1_14","volume-title":"Mathematical Foundations of Computer Science 2015","author":"C Dima","year":"2015","unstructured":"Dima, C., Maubert, B., Pinchinat, S.: Relating paths in transition systems: the fall of the modal mu-calculus. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 179\u2013191. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48057-1_14"},{"key":"23_CR25","unstructured":"Dima, C., Tiplea, F.: Model-checking ATL under imperfect information and perfect recall semantics is undecidable. CoRR abs\/1102.4225 (2011)"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Doyen, L., Raskin, J.F.: Games with imperfect information: theory and algorithms. In: Lecture Notes in Game Theory for Computer Scientists, pp. 185\u2013212. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511973468.007"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-27813-9_41","volume-title":"Computer Aided Verification","author":"P Gammie","year":"2004","unstructured":"Gammie, P., van der Meyden, R.: MCK: model checking the logic of knowledge. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 479\u2013483. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27813-9_41"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Huang, X., van der Meyden, R.: Symbolic model checking epistemic strategy logic. In: Proceedings of AAAI Conference on Artificial Intelligence, pp. 1426\u20131432 (2014)","DOI":"10.1609\/aaai.v28i1.8894"},{"key":"23_CR29","unstructured":"Jamroga, W.: Logical Methods for Specification and Verification of Multi-agent Systems. ICS PAS Publishing House (2015)"},{"key":"23_CR30","unstructured":"Jamroga, W., Dix, J.: Model checking ATL$$_{ir}$$ is indeed $$\\Delta _2^P$$-complete. In: Proceedings of EUMAS. CEUR Workshop Proceedings, vol. 223 (2006)"},{"key":"23_CR31","unstructured":"Jamroga, W., Penczek, W., Dembi\u0144ski, P., Mazurkiewicz, A.: Towards partial order reductions for strategic ability. In: Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 156\u2013165. IFAAMAS (2018)"},{"key":"23_CR32","doi-asserted-by":"publisher","unstructured":"Jamroga, W., Knapik, M.: Some things are easier for the dumb and the bright ones (beware the average!). In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence IJCAI, pp. 1734\u20131740 (2019). https:\/\/doi.org\/10.24963\/ijcai.2019\/240","DOI":"10.24963\/ijcai.2019\/240"},{"key":"23_CR33","doi-asserted-by":"publisher","unstructured":"Jamroga, W., Knapik, M., Kurpiewski, D., Mikulski, \u0141.: Approximate verification of strategic abilities under imperfect information. Artif. Intell. 277 (2019). https:\/\/doi.org\/10.1016\/j.artint.2019.103172","DOI":"10.1016\/j.artint.2019.103172"},{"key":"23_CR34","unstructured":"Kurpiewski, D., Jamroga, W., Knapik, M.: STV: Model checking for strategies under imperfect information. In: Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems AAMAS 2019, pp. 2372\u20132374. IFAAMAS (2019)"},{"key":"23_CR35","unstructured":"Kurpiewski, D., Knapik, M., Jamroga, W.: On domination and control in strategic ability. In: Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems AAMAS 2019, pp. 197\u2013205. IFAAMAS (2019)"},{"key":"23_CR36","unstructured":"Kurpiewski, D., Pazderski, W., Jamroga, W., Kim, Y.: STV+reductions: towards practical verification of strategic ability using model reductions. In: Proceedings of AAMAS, pp. 1770\u20131772. ACM (2021)"},{"issue":"1","key":"23_CR37","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10009-015-0378-x","volume":"19","author":"A Lomuscio","year":"2017","unstructured":"Lomuscio, A., Qu, H., Raimondi, F.: MCMAS: an open-source model checker for the verification of multi-agent systems. Int. J. Softw. Tools Technol. Transf. 19(1), 9\u201330 (2017). https:\/\/doi.org\/10.1007\/s10009-015-0378-x","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"23_CR38","doi-asserted-by":"publisher","unstructured":"Lomuscio, A., Raimondi, F.: Model checking knowledge, strategies, and games in multi-agent systems. In: Proceedings of International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 161\u2013168 (2006). https:\/\/doi.org\/10.1145\/1160633.1160660","DOI":"10.1145\/1160633.1160660"},{"issue":"4","key":"23_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2631917","volume":"15","author":"F Mogavero","year":"2014","unstructured":"Mogavero, F., Murano, A., Perelli, G., Vardi, M.: Reasoning about strategies: on the model-checking problem. ACM Trans. Comput. Log. 15(4), 1\u201342 (2014)","journal-title":"ACM Trans. Comput. Log."},{"key":"23_CR40","unstructured":"Mogavero, F., Murano, A., Vardi, M.: Reasoning about strategies. In: Proceedings of FSTTCS, pp. 133\u2013144 (2010)"},{"key":"23_CR41","doi-asserted-by":"crossref","unstructured":"Peterson, G., Reif, J.: Multiple-person alternation. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science (FOCS), pp. 348\u2013363. IEEE Computer Society Press (1979)","DOI":"10.1109\/SFCS.1979.25"},{"key":"23_CR42","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-319-09764-0_11","volume-title":"Computational Logic in Multi-Agent Systems","author":"J Pilecki","year":"2014","unstructured":"Pilecki, J., Bednarczyk, M.A., Jamroga, W.: Synthesis and verification of uniform strategies for multi-agent systems. In: Bulling, N., van der Torre, L., Villata, S., Jamroga, W., Vasconcelos, W. (eds.) CLIMA 2014. LNCS (LNAI), vol. 8624, pp. 166\u2013182. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09764-0_11"},{"issue":"7","key":"23_CR43","doi-asserted-by":"publisher","first-page":"1871","DOI":"10.1093\/logcom\/exw032","volume":"27","author":"J Pilecki","year":"2017","unstructured":"Pilecki, J., Bednarczyk, M., Jamroga, W.: SMC: synthesis of uniform strategies and verification of strategic ability for multi-agent systems. J. Log. Comput. 27(7), 1871\u20131895 (2017). https:\/\/doi.org\/10.1093\/logcom\/exw032","journal-title":"J. Log. Comput."},{"issue":"2","key":"23_CR44","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.jal.2005.12.010","volume":"5","author":"F Raimondi","year":"2007","unstructured":"Raimondi, F., Lomuscio, A.: Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams. J. Appl. Log. 5(2), 235\u2013251 (2007)","journal-title":"J. Appl. Log."},{"issue":"2","key":"23_CR45","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/S1571-0661(05)82604-0","volume":"85","author":"PY Schobbens","year":"2004","unstructured":"Schobbens, P.Y.: Alternating-time logic with imperfect recall. Electron. Notes Theor. Comput. Sci. 85(2), 82\u201393 (2004)","journal-title":"Electron. Notes Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43264-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T16:21:09Z","timestamp":1730046069000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43264-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031432637","9783031432644"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43264-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Naples","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"14 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eumas2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/vadimmalvone.github.io\/eumas2023\/","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":"47","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":"24","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":"5","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":"51% - 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":"4","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":"4","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":"PhD - Short Papers (20 submissions; 16 short papers accepted for proceedings)","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)"}}]}}