{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T03:48:13Z","timestamp":1784173693599,"version":"3.55.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T00:00:00Z","timestamp":1702252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T00:00:00Z","timestamp":1702252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071280, 12101262, 12001072"],"award-info":[{"award-number":["12071280, 12101262, 12001072"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10898-023-01346-0","type":"journal-article","created":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T08:01:47Z","timestamp":1702281707000},"page":"143-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Variable sample-size optimistic mirror descent algorithm for stochastic mixed variational inequalities"],"prefix":"10.1007","volume":"89","author":[{"given":"Zhen-Ping","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gui-Hua","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,11]]},"reference":[{"issue":"2","key":"1346_CR1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10589-021-00305-3","volume":"80","author":"A Alacaoglu","year":"2021","unstructured":"Alacaoglu, A., Malitsky, Y., Cevher, V.: Forward-reflected-backward method with variance reduction. Comput. Optim. Appl. 80(2), 321\u2013346 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"1346_CR2","unstructured":"Azizian, W., Iutzeler, F., Malick, J., Mertikopoulos, P.: The last-iterate convergence rate of optimistic mirror descent in stochastic variational inequalities. In: Proceedings of 34th Conference on Learning Theory, PMLR 134: 326\u2013358 (2021)"},{"issue":"2","key":"1346_CR3","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1137\/21M1420939","volume":"4","author":"A B\u00f6hm","year":"2022","unstructured":"B\u00f6hm, A., Sedlmayer, M., Csetnek, E.R., Bo\u0163, R.I.: Two steps at a time-taking GAN training in stride with Tseng\u2019s method. SIAM J. Math. Data Sci. 4(2), 750\u2013771 (2022)","journal-title":"SIAM J. Math. Data Sci."},{"issue":"2","key":"1346_CR4","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1287\/stsy.2019.0064","volume":"11","author":"RI Bo\u0163","year":"2021","unstructured":"Bo\u0163, R.I., Mertikopoulos, P., Staudigl, M., Vuong, P.T.: Minibatch forward-backward-forward methods for solving stochastic variational inequalities. Stoch. Syst. 11(2), 112\u2013139 (2021)","journal-title":"Stoch. Syst."},{"issue":"1","key":"1346_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10107-017-1161-4","volume":"165","author":"Y Chen","year":"2017","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Accelerated schemes for a class of variational inequalities. Math. Program. 165(1), 113\u2013149 (2017)","journal-title":"Math. Program."},{"issue":"2","key":"1346_CR6","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1137\/110825248","volume":"22","author":"X Chen","year":"2012","unstructured":"Chen, X., Wets, R.J.-B., Zhang, Y.: Stochastic variational inequalities: residual minimization smoothing sampling average approximations. SIAM J. Optim. 22(2), 649\u2013673 (2012)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1346_CR7","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s11228-021-00572-6","volume":"29","author":"S Cui","year":"2021","unstructured":"Cui, S., Shanbhag, U.V.: On the analysis of variance-reduced and randomized projection variants of single projection schemes for monotone stochastic variational inequality problems. Set-Valued Variat. Anal. 29(2), 453\u2013499 (2021)","journal-title":"Set-Valued Variat. Anal."},{"issue":"1","key":"1346_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10479-020-03585-w","volume":"301","author":"SD Fl\u00e5m","year":"2021","unstructured":"Fl\u00e5m, S.D.: Games and cost of change. Ann. Oper. Res. 301(1), 107\u2013119 (2021)","journal-title":"Ann. Oper. Res."},{"key":"1346_CR9","unstructured":"Gidel, G., Berard, H., Vignoud, G., Vincent, P., Lacoste-Julien, S.: A variational inequality perspective on generative adversarial networks. In: Proceedings of the 32th International Conference on Learning Representations (2019) https:\/\/openreview.net\/pdf?id=r1laEnA5Ym"},{"issue":"2","key":"1346_CR10","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s10957-021-01860-9","volume":"190","author":"SM Grad","year":"2021","unstructured":"Grad, S.M., Lara, F.: Solving mixed variational inequalities beyond convexity. J. Optim. Theory Appl. 190(2), 565\u2013580 (2021)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1346_CR11","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s10107-019-01435-7","volume":"185","author":"L Guo","year":"2021","unstructured":"Guo, L., Chen, X.: Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation. Math. Program. 185(1), 455\u2013485 (2021)","journal-title":"Math. Program."},{"issue":"2","key":"1346_CR12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s101070050024","volume":"84","author":"G G\u00fcrkan","year":"1999","unstructured":"G\u00fcrkan, G., Yonca \u00d6zge, A., Robinson, S.M.: Sample-path solution of stochastic variational inequalities. Math. Program. 84(2), 313\u2013333 (1999)","journal-title":"Math. Program."},{"key":"1346_CR13","unstructured":"Hsieh, Y.G., Iutzeler, F., Malick, J., Mertikopoulos, P.: Explore aggressively, update conservatively: Stochastic extragradient methods with variable stepsize scaling, Proceedings of the 33rd Conference on Neural Information Processing Systems, Vancouver Virtual, Canada, pp. 16223\u201316234 (2020)"},{"key":"1346_CR14","unstructured":"Hsieh, Y.G., Iutzeler, F., Malick, J., Mertikopoulos, P.: On the convergence of single-call stochastic extra-gradient methods. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, pp. 6936\u20136946 (2019)"},{"issue":"2","key":"1346_CR15","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1137\/15M1031953","volume":"27","author":"AN Iusem","year":"2017","unstructured":"Iusem, A.N., Jofr\u00e9, A., Oliveira, R.I., Thompson, P.: Extragradient method with variance reduction for stochastic variational inequalities. SIAM J. Optim. 27(2), 686\u2013724 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1346_CR16","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1137\/17M1144799","volume":"29","author":"AN Iusem","year":"2019","unstructured":"Iusem, A.N., Jofr\u00e9, A., Oliveira, R.I., Thompson, P.: Variance-based extragradient methods with line search for stochastic variational inequalities. SIAM J. Optim. 29(1), 175\u2013206 (2019)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1346_CR17","first-page":"236","volume":"44","author":"AN Iusem","year":"2018","unstructured":"Iusem, A.N., Jofr\u00e9, A., Thompson, P.: Incremental constraint projection methods for monotone stochastic variational inequalities. Math. Oper. Res. 44(1), 236\u2013263 (2018)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1346_CR18","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1007\/s10957-014-0673-9","volume":"165","author":"B Jadamba","year":"2015","unstructured":"Jadamba, B., Raciti, F.: Variational inequality approach to stochastic Nash equilibrium problems with an application to Cournot oligopoly. J. Optim. Theory Appl. 165(3), 1050\u20131070 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"6","key":"1346_CR19","doi-asserted-by":"crossref","first-page":"1462","DOI":"10.1109\/TAC.2008.925853","volume":"53","author":"H Jiang","year":"2008","unstructured":"Jiang, H., Xu, H.: Stochastic approximation approaches to the stochastic variational inequality problem. IEEE Trans. Autom. Control 53(6), 1462\u20131475 (2008)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1\u20132","key":"1346_CR20","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10107-018-01361-0","volume":"180","author":"PR Johnstone","year":"2020","unstructured":"Johnstone, P.R., Moulin, P.: Faster subgradient methods for functions with H\u00f6lderian growth. Math. Program. 180(1\u20132), 417\u2013450 (2020)","journal-title":"Math. Program."},{"issue":"1","key":"1346_CR21","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/10-SSY011","volume":"1","author":"A Juditsky","year":"2011","unstructured":"Juditsky, A., Nemirovski, A., Tauvel, C.: Solving variational inequalities with stochastic mirror-prox algorithm. Stoch. Syst. 1(1), 17\u201358 (2011)","journal-title":"Stoch. Syst."},{"issue":"3","key":"1346_CR22","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1007\/s10589-019-00120-x","volume":"74","author":"A Kannan","year":"2019","unstructured":"Kannan, A., Shanbhag, U.V.: Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants. Comput. Optim. Appl. 74(3), 779\u2013820 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"1346_CR23","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1109\/TAC.2012.2215413","volume":"58","author":"J Koshal","year":"2013","unstructured":"Koshal, J., Nedi\u0107, A., Shanbhag, U.V.: Regularized iterative stochastic approximation methods for stochastic variational inequality problems. IEEE Trans. Autom. Control 58(3), 594\u2013609 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"1346_CR24","doi-asserted-by":"crossref","first-page":"2041","DOI":"10.1137\/20M1381678","volume":"32","author":"G Kotsalis","year":"2022","unstructured":"Kotsalis, G., Lan, G., Li, T.: Simple and optimal methods for stochastic variational inequalities, I: operator extrapolation. SIAM J. Optim. 32(3), 2041\u20132073 (2022)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1346_CR25","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1137\/20M1381691","volume":"32","author":"G Kotsalis","year":"2022","unstructured":"Kotsalis, G., Lan, G., Li, T.: Simple and optimal methods for stochastic variational inequalities, II: Markovian noise and policy evaluation in reinforcement learning. SIAM J. Optim. 32(2), 1120\u20131155 (2022)","journal-title":"SIAM J. Optim."},{"key":"1346_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-39568-1","volume-title":"First-order and stochastic optimization methods for machine learning","author":"G Lan","year":"2020","unstructured":"Lan, G.: First-order and stochastic optimization methods for machine learning. Springer, Switzerland (2020)"},{"issue":"2","key":"1346_CR27","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1137\/20M1340071","volume":"32","author":"J Lei","year":"2022","unstructured":"Lei, J., Shanbhag, U.V.: Distributed variable sample-size gradient-response and best-response schemes for stochastic Nash equilibrium problems. SIAM J. Optim. 32(2), 573\u2013603 (2022)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1346_CR28","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1287\/moor.2018.0986","volume":"45","author":"J Lei","year":"2020","unstructured":"Lei, J., Shanbhag, U.V., Pang, J.S., Sen, S.: On synchronous, asynchronous, and randomized best-response schemes for stochastic Nash games. Math. Oper. Res. 45(1), 157\u2013190 (2020)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1346_CR29","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10107-019-01416-w","volume":"184","author":"Y Malitsky","year":"2020","unstructured":"Malitsky, Y.: Golden ratio algorithms for variational inequalities. Math. Program. 184(1), 383\u2013410 (2020)","journal-title":"Math. Program."},{"issue":"1","key":"1346_CR30","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/16M1092015","volume":"28","author":"Y Malitsky","year":"2018","unstructured":"Malitsky, Y., Pock, T.: A first-order primal-dual algorithm with linesearch. SIAM J. Optim. 28(1), 411\u2013432 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1346_CR31","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1137\/18M1207260","volume":"30","author":"Y Malitsky","year":"2020","unstructured":"Malitsky, Y., Tam, M.K.: A forward-backward splitting method for monotone inclusions without cocoercivity. SIAM J. Optim. 30(2), 1451\u20131472 (2020)","journal-title":"SIAM J. Optim."},{"key":"1346_CR32","unstructured":"Mertikopoulos, P., Lecouat, B., Zenati, H., Foo, C. S., Chandrasekhar, V., Piliouras, G.: Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile, Proceedings of the 7th International Conference on Learning Representations, pp. 1\u201323 (2019)"},{"key":"1346_CR33","unstructured":"Mishchenko, K., Kovalev, D., Shulgin, E., Richt\u00e1rik, P., Malitsky, Y.: Revisiting stochastic extragradient. In: Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics (AISTATS), Vol 108, 4573\u20134582 (2020)"},{"issue":"4","key":"1346_CR34","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky A, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1346_CR35","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: Prox-method with rate of convergence $$O(1\/t)$$ for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004)","journal-title":"SIAM J. Optim."},{"issue":"2\u20133","key":"1346_CR36","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10107-006-0034-z","volume":"109","author":"Y Nesterov","year":"2007","unstructured":"Nesterov, Y.: Dual extrapolation and its applications to solving variational inequalities and related problems. Math. Program. 109(2\u20133), 319\u2013344 (2007)","journal-title":"Math. Program."},{"issue":"3","key":"1346_CR37","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s00186-020-00721-x","volume":"92","author":"JV Outrata","year":"2020","unstructured":"Outrata, J.V., Valdman, J.: On computation of optimal strategies in oligopolistic markets respecting the cost of change. Math. Methods Oper. Res. 92(3), 489\u2013509 (2020)","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"1346_CR38","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22(3), 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"1346_CR39","first-page":"71","volume":"2013","author":"UV Shanbhag","year":"2013","unstructured":"Shanbhag, U.V.: Stochastic variational inequality problems: applications, analysis, and algorithms. INFORMS Tutor. Operat. Res. 2013, 71\u2013107 (2013)","journal-title":"INFORMS Tutor. Operat. Res."},{"issue":"2","key":"1346_CR40","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-014-0769-x","volume":"150","author":"M Wang","year":"2015","unstructured":"Wang, M., Bertsekas, D.P.: Incremental constraint projection methods for variational inequalities. Math. Program. 150(2), 321\u2013363 (2015)","journal-title":"Math. Program."},{"issue":"3","key":"1346_CR41","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s10957-020-01799-3","volume":"188","author":"X Xiao","year":"2021","unstructured":"Xiao, X.: A unified convergence analysis of stochastic Bregman proximal gradient and extragradient methods. J. Optim. Theory Appl. 188(3), 605\u2013627 (2021)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1346_CR42","doi-asserted-by":"crossref","first-page":"114132","DOI":"10.1016\/j.cam.2022.114132","volume":"408","author":"ZP Yang","year":"2022","unstructured":"Yang, Z.P., Lin, G.H.: Two fast variance-reduced proximal gradient algorithms for SMVIPs-Stochastic Mixed Variational Inequality Problems with suitable applications to stochastic network games and traffic assignment problems. J. Comput. Appl. Math. 408(3), 114132 (2022)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"1346_CR43","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s10957-021-01882-3","volume":"190","author":"ZP Yang","year":"2021","unstructured":"Yang, Z.P., Lin, G.H.: Variance-based single-call proximal extragradient algorithms for stochastic mixed variational inequalities. J. Optim. Theory Appl. 190(2), 393\u2013427 (2021)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1346_CR44","doi-asserted-by":"crossref","first-page":"2050011","DOI":"10.1142\/S0217595920500116","volume":"37","author":"ZP Yang","year":"2020","unstructured":"Yang, Z.P., Wang, Y., Lin, G.H.: Variance-based modified backward-forward algorithm with line search for stochastic variational inequality problems and its applications. Asia-Pacific J. Oper. Res. 37(3), 2050011 (2020)","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"1346_CR45","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s10915-021-01603-y","volume":"89","author":"ZP Yang","year":"2021","unstructured":"Yang, Z.P., Zhang, J., Wang, Y., Lin, G.H.: Variance-based subgradient extragradient method for stochastic variational inequality problems. J. Sci. Comput. 89, 4 (2021)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"1346_CR46","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/j.ejor.2008.09.008","volume":"198","author":"Y Yin","year":"2009","unstructured":"Yin, Y., Madanat, S.M., Lu, X.Y.: Robust improvement schemes for road networks under demand uncertainty. Eur. J. Oper. Res. 198(2), 470\u2013479 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1346_CR47","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10107-017-1175-y","volume":"165","author":"F Yousefian","year":"2017","unstructured":"Yousefian, F., Nedi\u0107, A., Shanbhag, U.V.: On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems. Math. Program. 165(1), 391\u2013431 (2017)","journal-title":"Math. Program."},{"issue":"4","key":"1346_CR48","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1007\/s11228-018-0472-9","volume":"26","author":"F Yousefian","year":"2018","unstructured":"Yousefian, F., Nedi\u0107, A., Shanbhag, U.V.: On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities randomized block coordinate and optimal averaging schemes. Set-Valued and Variational Analysis 26(4), 789\u2013819 (2018)","journal-title":"Set-Valued and Variational Analysis"},{"issue":"7","key":"1346_CR49","doi-asserted-by":"crossref","first-page":"1753","DOI":"10.1109\/TAC.2015.2478124","volume":"61","author":"F Yousefian","year":"2016","unstructured":"Yousefian, F., Nedi\u0107, A., Shanbhag, U.V.: Self-tuned stochastic approximation schemes for non-Lipschitzian stochastic multi-user optimization and Nash games. IEEE Trans. Autom. Control 61(7), 1753\u20131766 (2016)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"1346_CR50","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1007\/s10957-019-01578-9","volume":"183","author":"XJ Zhang","year":"2019","unstructured":"Zhang, X.J., Du, X.W., Yang, Z.P., Lin, G.H.: An infeasible stochastic approximation and projection algorithm for stochastic variational inequalities. J. Optim. Theory Appl. 183(3), 1053\u20131076 (2019)","journal-title":"J. Optim. Theory Appl."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01346-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-023-01346-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01346-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T12:20:16Z","timestamp":1714134016000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-023-01346-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,11]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1346"],"URL":"https:\/\/doi.org\/10.1007\/s10898-023-01346-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,11]]},"assertion":[{"value":"10 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}