{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:54:41Z","timestamp":1740160481974,"version":"3.37.3"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T00:00:00Z","timestamp":1674259200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T00:00:00Z","timestamp":1674259200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100018825","name":"Canadian Department of National Defence","doi-asserted-by":"crossref","award":["CFPMN2-30"],"award-info":[{"award-number":["CFPMN2-30"]}],"id":[{"id":"10.13039\/501100018825","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Dyn Games Appl"],"DOI":"10.1007\/s13235-023-00490-2","type":"journal-article","created":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T10:02:58Z","timestamp":1674295378000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Robustness and Sample Complexity of Model-Based MARL for General-Sum Markov Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4621-2677","authenticated-orcid":false,"given":"Jayakumar","family":"Subramanian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8125-1191","authenticated-orcid":false,"given":"Aditya","family":"Mahajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,21]]},"reference":[{"issue":"4","key":"490_CR1","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1257\/aer.91.4.938","volume":"91","author":"D Acemoglu","year":"2001","unstructured":"Acemoglu D, Robinson JA (2001) A theory of political transitions. Am Econ Rev 91(4):938\u2013963","journal-title":"Am Econ Rev"},{"key":"490_CR2","unstructured":"Agarwal A, Kakade S, Yang LF (2020) Model-based reinforcement learning with a generative model is minimax optimal. In Conference on Learning Theory, pages 67\u201383. PMLR"},{"issue":"1","key":"490_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1468-0262.2007.00731.x","volume":"75","author":"V Aguirregabiria","year":"2007","unstructured":"Aguirregabiria V, Mira P (2007) Sequential estimation of dynamic discrete games. Econometrica 75(1):1\u201353","journal-title":"Econometrica"},{"key":"490_CR4","unstructured":"Akchurina N (2010) Multi-agent reinforcement learning algorithms. PhD thesis, University of Paderborn"},{"issue":"1","key":"490_CR5","doi-asserted-by":"publisher","first-page":"134","DOI":"10.2307\/1426772","volume":"11","author":"SC Albright","year":"1979","unstructured":"Albright SC, Winston W (1979) A birth-death model of advertising and pricing. Adv Appl Probab 11(1):134\u2013152","journal-title":"Adv Appl Probab"},{"key":"490_CR6","volume-title":"Constrained Markov decision processes: stochastic modeling","author":"E Altman","year":"1999","unstructured":"Altman E (1999) Constrained Markov decision processes: stochastic modeling. CRC Press, Boca Raton"},{"issue":"3","key":"490_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10994-013-5368-1","volume":"91","author":"MG Azar","year":"2013","unstructured":"Azar MG, Munos R, Kappen HJ (2013) Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model. Mach Learn 91(3):325\u2013349","journal-title":"Mach Learn"},{"issue":"5","key":"490_CR8","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1111\/j.1468-0262.2007.00796.x","volume":"75","author":"P Bajari","year":"2007","unstructured":"Bajari P, Benkard CL, Levin J (2007) Estimating dynamic models of imperfect competition. Econometrica 75(5):1331\u20131370","journal-title":"Econometrica"},{"key":"490_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4757-5","volume-title":"H-infinity optimal control and related minimax design problems: a dynamic game approach","author":"T Ba\u015far","year":"2008","unstructured":"Ba\u015far T, Bernhard P (2008) H-infinity optimal control and related minimax design problems: a dynamic game approach. Springer Science & Business Media, NY"},{"key":"490_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44374-4","volume-title":"Handbook of dynamic game theory","author":"T Ba\u015far","year":"2018","unstructured":"Ba\u015far T, Zaccour G (2018) Handbook of dynamic game theory. Springer International Publishing, NY"},{"key":"490_CR11","volume-title":"Dynamic programming and optimal control","author":"DP Bertsekas","year":"2017","unstructured":"Bertsekas DP (2017) Dynamic programming and optimal control. Athena Scientific, Belmont, MA"},{"key":"490_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3760-7_5","volume-title":"Algorithms for stochastic games","author":"M Breton","year":"1991","unstructured":"Breton M (1991) Algorithms for stochastic games. Springer, NY"},{"issue":"2","key":"490_CR13","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1109\/TSMCC.2007.913919","volume":"38","author":"L Busoniu","year":"2008","unstructured":"Busoniu L, Babuska R, De\u00a0Schutter B (2008) A comprehensive survey of multiagent reinforcement learning. IEEE Trans Syst, Man, Cybern, Part C (Appl Rev) 38(2):156\u2013172","journal-title":"IEEE Trans Syst, Man, Cybern, Part C (Appl Rev)"},{"key":"490_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, learning, and games","author":"N Cesa-Bianch","year":"2006","unstructured":"Cesa-Bianch N, Lugosi G (2006) Prediction, learning, and games. Cambridge university press, Cambridge"},{"key":"490_CR15","doi-asserted-by":"crossref","unstructured":"Deng X, Li Y, Mguni DH, Wang J, Yang Y (2021) On the complexity of computing markov perfect equilibrium in general-sum stochastic games. http:\/\/arxiv.org\/abs\/2109.01795","DOI":"10.1093\/nsr\/nwac256"},{"issue":"3","key":"490_CR16","doi-asserted-by":"publisher","first-page":"369","DOI":"10.3982\/TE632","volume":"5","author":"U Doraszelski","year":"2010","unstructured":"Doraszelski U, Escobar JF (2010) A theory of regular Markov perfect equilibria in dynamic stochastic games: Genericity, stability, and purification. Theor Econ 5(3):369\u2013402","journal-title":"Theor Econ"},{"issue":"1","key":"490_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/2297841","volume":"62","author":"R Ericson","year":"1995","unstructured":"Ericson R, Pakes A (1995) Markov-perfect industry dynamics: a framework for empirical work. Rev Econ Stud 62(1):53\u201382","journal-title":"Rev Econ Stud"},{"issue":"2","key":"490_CR18","doi-asserted-by":"publisher","first-page":"207","DOI":"10.2307\/2601038","volume":"31","author":"C Fershtiman","year":"2000","unstructured":"Fershtiman C, Pakes A (2000) A dynamic oligopoly with collusion and price wars. RAND J Econ 31(2):207\u2013236","journal-title":"RAND J Econ"},{"key":"490_CR19","doi-asserted-by":"crossref","unstructured":"Filar J, Vrieze K (1996) Competitive Markov Decision Processes. Springer, New York, NY. 978-1-4612-8481-9 978-1-4612-4054-9","DOI":"10.1007\/978-1-4612-4054-9"},{"issue":"1","key":"490_CR20","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF01594936","volume":"50","author":"JA Filar","year":"1991","unstructured":"Filar JA, Schultz TA, Thuijsman F, Vrieze O (1991) Nonlinear programming and stationary equilibria in stochastic games. Math Program 50(1):227\u2013237","journal-title":"Math Program"},{"key":"490_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.32917\/hmj\/1206139508","volume":"28","author":"AM Fink","year":"1964","unstructured":"Fink AM (1964) Equilibrium in a stochastic n-person game. Hiroshima Math J 28:1","journal-title":"Hiroshima Math J"},{"issue":"1","key":"490_CR22","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00199-009-0441-5","volume":"42","author":"PJ-J Herings","year":"2010","unstructured":"Herings PJ-J, Peeters R (2010) Homotopy methods to compute equilibria in game theory. Econ Theory 42(1):119\u2013156","journal-title":"Econ Theory"},{"issue":"1","key":"490_CR23","first-page":"32","volume":"118","author":"PJ-J Herings","year":"2004","unstructured":"Herings PJ-J, Peeters RJ et al (2004) Stationary equilibria in stochastic games: structure, selection, and computation. J Econ Theory 118(1):32\u201360","journal-title":"J Econ Theory"},{"key":"490_CR24","doi-asserted-by":"crossref","unstructured":"Hinderer K (2005) Lipschitz continuity of value functions in Markovian decision processes. Mathematical Methods of Operations Research, 62 (1): 3\u201322. ISSN 1432-5217","DOI":"10.1007\/s00186-005-0438-1"},{"issue":"5","key":"490_CR25","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1287\/mnsc.12.5.359","volume":"12","author":"AJ Hoffman","year":"1966","unstructured":"Hoffman AJ, Karp RM (1966) On nonterminating stochastic games. Manage Sci 12(5):359\u2013370","journal-title":"Manage Sci"},{"issue":"2","key":"490_CR26","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1016\/j.jmaa.2014.05.061","volume":"419","author":"A Ja\u015bkiewicz","year":"2014","unstructured":"Ja\u015bkiewicz A, Nowak AS (2014) Robust Markov perfect equilibria. J Math Anal Appl 419(2):1322\u20131332","journal-title":"J Math Anal Appl"},{"key":"490_CR27","unstructured":"Kakade SM (2003) On the sample complexity of reinforcement learning. PhD thesis, University College, London"},{"key":"490_CR28","first-page":"996","volume":"871","author":"M Kearns","year":"1999","unstructured":"Kearns M, Singh S (1999) Finite-sample convergence rates for q-learning and indirect algorithms. Adv Neural Inf Process Syst 871:996\u20131002","journal-title":"Adv Neural Inf Process Syst"},{"key":"490_CR29","unstructured":"Krupnik O, Mordatch I, Tamar A (2019) Multi-agent reinforcement learning with multi-step generative models. http:\/\/arxiv.org\/abs\/1901.10251"},{"key":"490_CR30","unstructured":"Leonardos S, Overman W, Panageas I, Piliouras G (2021) Global convergence of multi-agent policy gradient in markov potential games. http:\/\/arxiv.org\/abs\/2106.01969"},{"key":"490_CR31","first-page":"12861","volume":"33","author":"G Li","year":"2020","unstructured":"Li G, Wei Y, Chi Y, Gu Y, Chen Y (2020) Breaking the sample size barrier in model-based reinforcement learning with a generative model. Adv Neural Inf Process Syst 33:12861","journal-title":"Adv Neural Inf Process Syst"},{"key":"490_CR32","doi-asserted-by":"crossref","unstructured":"Littman ML (1994) Markov games as a framework for multi-agent reinforcement learning. In International Conference on Machine Learning, pages 157\u2013163. Elsevier","DOI":"10.1016\/B978-1-55860-335-6.50027-1"},{"issue":"1","key":"490_CR33","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S1389-0417(01)00015-8","volume":"2","author":"ML Littman","year":"2001","unstructured":"Littman ML (2001) Value-function reinforcement learning in Markov games. Cognit Syst Res 2(1):55\u201366","journal-title":"Cognit Syst Res"},{"key":"490_CR34","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780195300796.001.0001","volume-title":"Repeated games and reputations: long-run relationships","author":"GJ Mailath","year":"2006","unstructured":"Mailath GJ, Samuelson L (2006) Repeated games and reputations: long-run relationships. Oxford University Press, Oxford"},{"key":"490_CR35","doi-asserted-by":"crossref","unstructured":"Maskin E, Tirole J (1988) A theory of dynamic oligopoly, I: Overview and quantity competition with large fixed costs. Econometrica: J Econ Soc 549\u2013569","DOI":"10.2307\/1911700"},{"key":"490_CR36","doi-asserted-by":"crossref","unstructured":"Maskin E, Tirole J (1988) A theory of dynamic oligopoly, II: Price competition, kinked demand curves, and edgeworth cycles. Econometrica: J Econ Soc 571\u2013599","DOI":"10.2307\/1911701"},{"issue":"2","key":"490_CR37","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1006\/jeth.2000.2785","volume":"100","author":"E Maskin","year":"2001","unstructured":"Maskin E, Tirole J (2001) Markov perfect equilibrium: I. observable actions. J Econ Theory 100(2):191\u2013219","journal-title":"J Econ Theory"},{"issue":"4","key":"490_CR38","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1287\/moor.22.4.872","volume":"22","author":"A M\u00fcller","year":"1997","unstructured":"M\u00fcller A (1997) How does the value function of a Markov decision process depend on the transition probabilities? Math Op Res 22(4):872\u2013885","journal-title":"Math Op Res"},{"issue":"2","key":"490_CR39","doi-asserted-by":"publisher","first-page":"429","DOI":"10.2307\/1428011","volume":"29","author":"A M\u00fcller","year":"1997","unstructured":"M\u00fcller A (1997) Integral probability metrics and their generating classes of functions. Adv Appl Probab 29(2):429\u2013443","journal-title":"Adv Appl Probab"},{"issue":"2","key":"490_CR40","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1111\/j.1756-2171.2007.tb00073.x","volume":"38","author":"A Pakes","year":"2007","unstructured":"Pakes A, Ostrovsky M, Berry S (2007) Simple estimators for the parameters of discrete dynamic games (with entry\/exit examples). RAND J Econ 38(2):373\u2013399","journal-title":"RAND J Econ"},{"key":"490_CR41","unstructured":"P\u00e9rolat J, Strub F, Piot B, Pietquin O (2017) Learning Nash equilibrium for general-sum Markov games from batch data. In Artificial Intelligence and Statistics, pages 232\u2013241. PMLR"},{"issue":"3","key":"490_CR42","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1111\/j.1467-937X.2008.00496.x","volume":"75","author":"M Pesendorfer","year":"2008","unstructured":"Pesendorfer M, Schmidt-Dengler P (2008) Asymptotic least squares estimators for dynamic games. Rev Econ Stud 75(3):901\u2013928","journal-title":"Rev Econ Stud"},{"key":"490_CR43","unstructured":"Prasad H, LA P, Bhatnagar S (2015) Two-timescale algorithms for learning Nash equilibria in general-sum stochastic games. In Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, pages 1371\u20131379"},{"key":"490_CR44","unstructured":"Rogers PD (1969) Nonzero-sum stochastic games. PhD thesis, University of California, Berkeley"},{"key":"490_CR45","doi-asserted-by":"crossref","unstructured":"Sengupta S, Chowdhary A, Huang D, Kambhampati S (2019) General sum markov games for strategic detection of advanced persistent threats using moving target defense in cloud networks. In International Conference on Decision and Game Theory for Security, pages 492\u2013512. Springer","DOI":"10.1007\/978-3-030-32430-8_29"},{"issue":"10","key":"490_CR46","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1073\/pnas.39.10.1095","volume":"39","author":"LS Shapley","year":"1953","unstructured":"Shapley LS (1953) Stochastic games. Proc Nat Acad Sci 39(10):1095\u20131100","journal-title":"Proc Nat Acad Sci"},{"key":"490_CR47","unstructured":"Shoham Y, Powers R, Grenager T (2003) Multi-agent reinforcement learning: a critical survey. Technical report, Stanford University"},{"key":"490_CR48","unstructured":"Sidford A, Wang M, Wu X, Yang LF, Ye Y (2018) Near-optimal time and sample complexities for solving markov decision processes with a generative model. In Proceedings of the 32nd International Conference on Neural Information Processing Systems, pages 5192\u20135202"},{"key":"490_CR49","unstructured":"Sidford A, Wang M, Yang L, Ye Y (2020) Solving discounted stochastic two-player games with near-optimal time and sample complexity. In International Conference on Artificial Intelligence and Statistics, pages 2992\u20133002. PMLR"},{"key":"490_CR50","volume-title":"A course in stochastic game theory","author":"E Solan","year":"2021","unstructured":"Solan E (2021) A course in stochastic game theory. Cambridge University Press, Cambridge"},{"key":"490_CR51","unstructured":"Song Z, Mei S, Bai Y (2021) When can we learn general-sum markov games with a large number of players sample-efficiently? http:\/\/arxiv.org\/abs\/2110.04184"},{"key":"490_CR52","unstructured":"Sriperumbudur BK, Gretton A, Fukumizu K, Lanckriet GRG, Sch\u00f6lkopf B (2008) Injective Hilbert space embeddings of probability measures. In Conference on Learning Theory,"},{"key":"490_CR53","first-page":"1","volume":"23","author":"J Subramanian","year":"2022","unstructured":"Subramanian J, Sinha A, Seraj R, Mahajan A (2022) Approximate information state for approximate planning and reinforcement learning in partially observed systems. J Mach Learn Res 23:1\u201312","journal-title":"J Mach Learn Res"},{"key":"490_CR54","doi-asserted-by":"crossref","unstructured":"Sutton RS (1990) Integrated architectures for learning, planning, and reacting based on approximating dynamic programming. In International Conference on Machine Learning, pages 216\u2013224. San Francisco (CA)","DOI":"10.1016\/B978-1-55860-141-3.50030-4"},{"issue":"1","key":"490_CR55","doi-asserted-by":"publisher","first-page":"95","DOI":"10.32917\/hmj\/1206139509","volume":"28","author":"M Takahashi","year":"1964","unstructured":"Takahashi M (1964) Equilibrium points of stochastic non-cooperative $$n$$-person games. Hiroshima Math J 28(1):95","journal-title":"Hiroshima Math J"},{"issue":"1","key":"490_CR56","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1137\/S036301299325534X","volume":"34","author":"MM Tidball","year":"1996","unstructured":"Tidball MM, Altman E (1996) Approximations in dynamic zero-sum games I. SIAM J Control Optim 34(1):311\u2013328","journal-title":"SIAM J Control Optim"},{"issue":"6","key":"490_CR57","doi-asserted-by":"publisher","first-page":"2101","DOI":"10.1137\/S0363012994272460","volume":"35","author":"MM Tidball","year":"1997","unstructured":"Tidball MM, Pourtallier O, Altman E (1997) Approximations in dynamic zero-sum games II. SIAM J Control Optim 35(6):2101\u20132117","journal-title":"SIAM J Control Optim"},{"key":"490_CR58","unstructured":"Vrieze OJ (1987) Stochastic games with finite state and action spaces. CWI, Jan. ISBN 978-90-6196-313-4"},{"key":"490_CR59","unstructured":"Wang T, Bao X, Clavera I, Hoang J, Wen Y, Langlois E, Zhang S, Zhang G, Abbeel P, Ba J (2019) Benchmarking Model-Based Reinforcement Learning. http:\/\/arxiv.org\/abs\/1907.02057"},{"issue":"1","key":"490_CR60","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0318003","volume":"18","author":"W Whitt","year":"1980","unstructured":"Whitt W (1980) Representation and approximation of noncooperative sequential games. SIAM J Control Optim 18(1):33\u201348","journal-title":"SIAM J Control Optim"},{"key":"490_CR61","first-page":"1166","volume":"33","author":"K Zhang","year":"2020","unstructured":"Zhang K, Kakade S, Basar T, Yang L (2020) Model-based multi-agent rl in zero-sum Markov games with near-optimal sample complexity. Adv Neural Inf Process Syst 33:1166","journal-title":"Adv Neural Inf Process Syst"},{"key":"490_CR62","doi-asserted-by":"crossref","unstructured":"Zhang K, Yang Z, Ba\u015far T (2021) Multi-agent reinforcement learning: A selective overview of theories and algorithms. Handbook of Reinforcement Learning and Control, pages 321\u2013384","DOI":"10.1007\/978-3-030-60990-0_12"},{"key":"490_CR63","unstructured":"Zhang R, Ren Z, Li N (2021) Gradient play in multi-agent markov stochastic games: Stationary points and convergence. arXiv e-prints, pages arXiv\u20132106"},{"key":"490_CR64","doi-asserted-by":"crossref","unstructured":"Zhang W, Wang X, Shen J, Zhou M (2021) Model-based Multi-agent Policy Optimization with Adaptive Opponent-wise Rollouts. In International Joint Conference on Artificial Intelligence. Montreal, Canada","DOI":"10.24963\/ijcai.2021\/466"},{"key":"490_CR65","unstructured":"Zinkevich M, Greenwald A, Littman M (2006) Cyclic equilibria in Markov games. In Neural Information Processing Systems, pages 1641\u20131648"}],"container-title":["Dynamic Games and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-023-00490-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13235-023-00490-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-023-00490-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T10:32:50Z","timestamp":1674297170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13235-023-00490-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,21]]},"references-count":65,"alternative-id":["490"],"URL":"https:\/\/doi.org\/10.1007\/s13235-023-00490-2","relation":{},"ISSN":["2153-0785","2153-0793"],"issn-type":[{"type":"print","value":"2153-0785"},{"type":"electronic","value":"2153-0793"}],"subject":[],"published":{"date-parts":[[2023,1,21]]},"assertion":[{"value":"8 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}