{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T08:23:44Z","timestamp":1775031824139,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T00:00:00Z","timestamp":1615593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T00:00:00Z","timestamp":1615593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["024.002.003"],"award-info":[{"award-number":["024.002.003"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["024.002.003"],"award-info":[{"award-number":["024.002.003"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"crossref","award":["613.001.352"],"award-info":[{"award-number":["613.001.352"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"crossref","award":["613.001.352"],"award-info":[{"award-number":["613.001.352"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2018\/29\/B\/ST1\/00756"],"award-info":[{"award-number":["2018\/29\/B\/ST1\/00756"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2021,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents an analysis of the stochastic recursion <jats:inline-formula><jats:alternatives><jats:tex-math>$$W_{i+1} = [V_iW_i+Y_i]^+$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>W<\/mml:mi>\n                      <mml:mrow>\n                        <mml:mi>i<\/mml:mi>\n                        <mml:mo>+<\/mml:mo>\n                        <mml:mn>1<\/mml:mn>\n                      <\/mml:mrow>\n                    <\/mml:msub>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:msup>\n                      <mml:mrow>\n                        <mml:mo>[<\/mml:mo>\n                        <mml:msub>\n                          <mml:mi>V<\/mml:mi>\n                          <mml:mi>i<\/mml:mi>\n                        <\/mml:msub>\n                        <mml:msub>\n                          <mml:mi>W<\/mml:mi>\n                          <mml:mi>i<\/mml:mi>\n                        <\/mml:msub>\n                        <mml:mo>+<\/mml:mo>\n                        <mml:msub>\n                          <mml:mi>Y<\/mml:mi>\n                          <mml:mi>i<\/mml:mi>\n                        <\/mml:msub>\n                        <mml:mo>]<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:mo>+<\/mml:mo>\n                    <\/mml:msup>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> that can be interpreted as an autoregressive process of order 1, reflected at 0. We start our exposition by a discussion of the model\u2019s stability condition. Writing <jats:inline-formula><jats:alternatives><jats:tex-math>$$Y_i=B_i-A_i$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>Y<\/mml:mi>\n                      <mml:mi>i<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>B<\/mml:mi>\n                      <mml:mi>i<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>-<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>A<\/mml:mi>\n                      <mml:mi>i<\/mml:mi>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, for independent sequences of nonnegative i.i.d. random variables <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\{A_i\\}_{i\\in {\\mathbb N}_0}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mrow>\n                      <mml:mo>{<\/mml:mo>\n                      <mml:msub>\n                        <mml:mi>A<\/mml:mi>\n                        <mml:mi>i<\/mml:mi>\n                      <\/mml:msub>\n                      <mml:mo>}<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mrow>\n                      <mml:mi>i<\/mml:mi>\n                      <mml:mo>\u2208<\/mml:mo>\n                      <mml:msub>\n                        <mml:mi>N<\/mml:mi>\n                        <mml:mn>0<\/mml:mn>\n                      <\/mml:msub>\n                    <\/mml:mrow>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\{B_i\\}_{i\\in {\\mathbb N}_0}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mrow>\n                      <mml:mo>{<\/mml:mo>\n                      <mml:msub>\n                        <mml:mi>B<\/mml:mi>\n                        <mml:mi>i<\/mml:mi>\n                      <\/mml:msub>\n                      <mml:mo>}<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mrow>\n                      <mml:mi>i<\/mml:mi>\n                      <mml:mo>\u2208<\/mml:mo>\n                      <mml:msub>\n                        <mml:mi>N<\/mml:mi>\n                        <mml:mn>0<\/mml:mn>\n                      <\/mml:msub>\n                    <\/mml:mrow>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and assuming <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\{V_i\\}_{i\\in {\\mathbb N}_0}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mrow>\n                      <mml:mo>{<\/mml:mo>\n                      <mml:msub>\n                        <mml:mi>V<\/mml:mi>\n                        <mml:mi>i<\/mml:mi>\n                      <\/mml:msub>\n                      <mml:mo>}<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mrow>\n                      <mml:mi>i<\/mml:mi>\n                      <mml:mo>\u2208<\/mml:mo>\n                      <mml:msub>\n                        <mml:mi>N<\/mml:mi>\n                        <mml:mn>0<\/mml:mn>\n                      <\/mml:msub>\n                    <\/mml:mrow>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is an i.i.d. sequence as well (independent of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\{A_i\\}_{i\\in {\\mathbb N}_0}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mrow>\n                      <mml:mo>{<\/mml:mo>\n                      <mml:msub>\n                        <mml:mi>A<\/mml:mi>\n                        <mml:mi>i<\/mml:mi>\n                      <\/mml:msub>\n                      <mml:mo>}<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mrow>\n                      <mml:mi>i<\/mml:mi>\n                      <mml:mo>\u2208<\/mml:mo>\n                      <mml:msub>\n                        <mml:mi>N<\/mml:mi>\n                        <mml:mn>0<\/mml:mn>\n                      <\/mml:msub>\n                    <\/mml:mrow>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\{B_i\\}_{i\\in {\\mathbb N}_0}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mrow>\n                      <mml:mo>{<\/mml:mo>\n                      <mml:msub>\n                        <mml:mi>B<\/mml:mi>\n                        <mml:mi>i<\/mml:mi>\n                      <\/mml:msub>\n                      <mml:mo>}<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mrow>\n                      <mml:mi>i<\/mml:mi>\n                      <mml:mo>\u2208<\/mml:mo>\n                      <mml:msub>\n                        <mml:mi>N<\/mml:mi>\n                        <mml:mn>0<\/mml:mn>\n                      <\/mml:msub>\n                    <\/mml:mrow>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>), we then consider three special cases (i) <jats:inline-formula><jats:alternatives><jats:tex-math>$$V_i$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>V<\/mml:mi>\n                    <mml:mi>i<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> equals a positive value <jats:italic>a<\/jats:italic> with certain probability <jats:inline-formula><jats:alternatives><jats:tex-math>$$p\\in (0,1)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>\u2208<\/mml:mo>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mn>0<\/mml:mn>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and is negative otherwise, and both <jats:inline-formula><jats:alternatives><jats:tex-math>$$A_i$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>A<\/mml:mi>\n                    <mml:mi>i<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$B_i$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>B<\/mml:mi>\n                    <mml:mi>i<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> have a rational LST, (ii) <jats:inline-formula><jats:alternatives><jats:tex-math>$$V_i$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>V<\/mml:mi>\n                    <mml:mi>i<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> attains negative values only and <jats:inline-formula><jats:alternatives><jats:tex-math>$$B_i$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>B<\/mml:mi>\n                    <mml:mi>i<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> has a rational LST, (iii) <jats:inline-formula><jats:alternatives><jats:tex-math>$$V_i$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>V<\/mml:mi>\n                    <mml:mi>i<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is uniformly distributed on [0,\u00a01], and <jats:inline-formula><jats:alternatives><jats:tex-math>$$A_i$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>A<\/mml:mi>\n                    <mml:mi>i<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is exponentially distributed. In all three cases, we derive transient and stationary results, where the transient results are in terms of the transform at a geometrically distributed epoch.\n<\/jats:p>","DOI":"10.1007\/s11134-021-09698-8","type":"journal-article","created":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T05:02:46Z","timestamp":1615611766000},"page":"225-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A multiplicative version of the Lindley recursion"],"prefix":"10.1007","volume":"98","author":[{"given":"Onno","family":"Boxma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"L\u00f6pker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Mandjes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9257-1115","authenticated-orcid":false,"given":"Zbigniew","family":"Palmowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,13]]},"reference":[{"key":"9698_CR1","volume-title":"Applied Probability and Queues","author":"S Asmussen","year":"2008","unstructured":"Asmussen, S.: Applied Probability and Queues. Springer, Berlin (2008)"},{"key":"9698_CR2","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0304-4149(98)00016-7","volume":"75","author":"J Biggins","year":"1998","unstructured":"Biggins, J.: Lindley-type equations in the branching random walk. Stoch. Process. Appl. 75, 105\u2013133 (1998)","journal-title":"Stoch. Process. Appl."},{"key":"9698_CR3","volume-title":"Ergodicity and Stability of Stochastic Processes","author":"AA Borovkov","year":"1998","unstructured":"Borovkov, A.A.: Ergodicity and Stability of Stochastic Processes. Wiley, New York (1998)"},{"issue":"1","key":"9698_CR4","first-page":"16","volume":"2","author":"AA Borovkov","year":"1992","unstructured":"Borovkov, A.A., Foss, S.G.: Stochastically recursive sequences and their generalizations. Sib. Adv. Math. 2(1), 16\u201381 (1992)","journal-title":"Sib. Adv. Math."},{"key":"9698_CR5","doi-asserted-by":"crossref","unstructured":"Boxma, O., Mandjes, M.: Affine storage and insurance risk models. Math. Oper. Res. (2021) (to appear)","DOI":"10.1287\/moor.2020.1097"},{"key":"9698_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s11134-007-9011-3","volume":"56","author":"O Boxma","year":"2007","unstructured":"Boxma, O., Vlasiou, M.: On queues with service and interarrival times depending on waiting times. Queueing Syst. 56, 121\u2013132 (2007)","journal-title":"Queueing Syst."},{"issue":"3","key":"9698_CR7","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1017\/jpr.2016.42","volume":"53","author":"O Boxma","year":"2016","unstructured":"Boxma, O., Mandjes, M., Reed, J.: On a class of reflected AR(1) processes. J. Appl. Probab. 53(3), 818\u2013832 (2016)","journal-title":"J. Appl. Probab."},{"issue":"2","key":"9698_CR8","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1017\/jpr.2020.6","volume":"57","author":"O Boxma","year":"2020","unstructured":"Boxma, O., L\u00f6pker, A., Mandjes, M.: On two classes of reflected autoregressive processes. J. Appl. Probab. 57(2), 657\u2013678 (2020)","journal-title":"J. Appl. Probab."},{"issue":"1","key":"9698_CR9","first-page":"211","volume":"18","author":"A Brandt","year":"1986","unstructured":"Brandt, A.: The stochastic equation $$Y_{n+ 1}= A_n Y_n+ B_n$$ with stationary coefficients. Adv. Appl. Probab. 18(1), 211\u2013220 (1986)","journal-title":"Adv. Appl. Probab."},{"issue":"S1","key":"9698_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1017\/S0021900200047616","volume":"12","author":"JW Cohen","year":"1975","unstructured":"Cohen, J.W.: The Wiener\u2013Hopf technique in applied probability. J. Appl. Probab. 12(S1), 145\u2013156 (1975)","journal-title":"J. Appl. Probab."},{"key":"9698_CR11","volume-title":"The Single Server Queue","author":"JW Cohen","year":"1982","unstructured":"Cohen, J.W.: The Single Server Queue. North Holland, New York (1982)"},{"issue":"1","key":"9698_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/A:1011470225335","volume":"3","author":"L Devroye","year":"2001","unstructured":"Devroye, L.: Simulating perpetuities. Methodol. Comput. Appl. Probab. 3(1), 97\u2013115 (2001)","journal-title":"Methodol. Comput. Appl. Probab."},{"issue":"1","key":"9698_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1137\/S0036144598338446","volume":"41","author":"P Diaconis","year":"1999","unstructured":"Diaconis, P., Freedman, D.: Iterated random functions. SIAM Rev. 41(1), 45\u201376 (1999)","journal-title":"SIAM Rev."},{"key":"9698_CR14","doi-asserted-by":"crossref","unstructured":"Embrechts, P., Goldie, C.: Perpetuities and random equations. In: Asymptotic Statistics, pp. 75\u201386. Springer, Berlin (1994)","DOI":"10.1007\/978-3-642-57984-4_6"},{"issue":"4","key":"9698_CR15","first-page":"275","volume":"47","author":"S Foss","year":"2004","unstructured":"Foss, S., Konstantopoulos, T.: An overview of some stochastic stability methods. J. Oper. Res. Soc. Jpn. 47(4), 275\u2013303 (2004)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"9698_CR16","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.jet.2017.11.004","volume":"173","author":"S Foss","year":"2018","unstructured":"Foss, S., Shneer, V., Thomas, J.P., Worrall, T.: Stochastic stability of monotone economies in regenerative environments. J. Econ. Theory 173, 334\u2013360 (2018)","journal-title":"J. Econ. Theory"},{"issue":"1","key":"9698_CR17","first-page":"80","volume":"38","author":"U Horst","year":"2001","unstructured":"Horst, U.: The stochastic equation $$Y_{t+ 1}= A_t Y_t+ B_t$$ with non-stationary coefficients. J. Appl. Probab. 38(1), 80\u201394 (2001)","journal-title":"J. Appl. Probab."},{"key":"9698_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-4149(94)90058-2","volume":"53","author":"F Karpelevich","year":"1994","unstructured":"Karpelevich, F., Kelbert, M., Suhov, Y.: Higher-order Lindley equations. Stoch. Process. Appl. 53, 65\u201396 (1994)","journal-title":"Stoch. Process. Appl."},{"key":"9698_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF02392040","volume":"131","author":"H Kesten","year":"1973","unstructured":"Kesten, H.: Random difference equations and renewal theory for products of random matrices. Acta Math. 131, 207\u2013248 (1973)","journal-title":"Acta Math."},{"key":"9698_CR20","doi-asserted-by":"crossref","unstructured":"Olvera-Cravioto, M., Ruiz-Lacedelli, O.: Stationary waiting time in parallel queues with synchronization. Math. Oper. Res. 46(1), 1\u201327 (2021)","DOI":"10.1287\/moor.2019.1045"},{"key":"9698_CR21","volume-title":"The Theory of Functions","author":"EC Titchmarsh","year":"1968","unstructured":"Titchmarsh, E.C.: The Theory of Functions. Oxford University Press, Oxford (1968)"},{"issue":"4","key":"9698_CR22","doi-asserted-by":"publisher","first-page":"750","DOI":"10.2307\/1426858","volume":"11","author":"W Vervaat","year":"1979","unstructured":"Vervaat, W.: On a stochastic difference equation and a representation of non-negative infinitely divisible random variables. Adv. Appl. Probab. 11(4), 750\u2013783 (1979)","journal-title":"Adv. Appl. Probab."},{"key":"9698_CR23","unstructured":"Vlasiou, M.: Lindley-type recursions. Ph.D. thesis, Eindhoven University of Technology (2006)"},{"issue":"1","key":"9698_CR24","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BF02411482","volume":"6","author":"W Whitt","year":"1990","unstructured":"Whitt, W.: Queues with service times and interarrival times depending linearly and randomly upon waiting times. Queueing Syst. 6(1), 335\u2013351 (1990)","journal-title":"Queueing Syst."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-021-09698-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11134-021-09698-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-021-09698-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T06:18:31Z","timestamp":1629785911000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11134-021-09698-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,13]]},"references-count":24,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["9698"],"URL":"https:\/\/doi.org\/10.1007\/s11134-021-09698-8","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,13]]},"assertion":[{"value":"3 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}