{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T05:28:13Z","timestamp":1769059693204,"version":"3.49.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003549","name":"OTKA","doi-asserted-by":"crossref","award":["K128611"],"award-info":[{"award-number":["K128611"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"crossref"}]},{"name":"J\u00e1nos Bolyai Research Fellowship"},{"name":"COST Action European Network for Game Theory","award":["CA16228"],"award-info":[{"award-number":["CA16228"]}]},{"DOI":"10.13039\/501100001602","name":"Science Foundation Ireland","doi-asserted-by":"crossref","award":["12\/RC\/2289-P2 ; 16\/SP\/3804 ; 16\/RC\/3918"],"award-info":[{"award-number":["12\/RC\/2289-P2 ; 16\/SP\/3804 ; 16\/RC\/3918"]}],"id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["12\/RC\/2289-P2 ; 16\/SP\/3804 ; 16\/RC\/3918"],"award-info":[{"award-number":["12\/RC\/2289-P2 ; 16\/SP\/3804 ; 16\/RC\/3918"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001636","name":"University College Cork","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001636","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce five constraint models for the 3-dimensional stable matching problem with cyclic preferences and study their relative performances under diverse configurations. While several constraint models have been proposed for variants of the two-dimensional stable matching problem, we are the first to present constraint models for a higher number of dimensions. We show for all five models how to capture two different stability notions, namely weak and strong stability. Additionally, we translate some well-known fairness notions (i.e. sex-equal, minimum regret, egalitarian) into 3-dimensional matchings, and present how to capture them in each model. Our tests cover dozens of problem sizes and four different instance generation methods. We explore two levels of commitment in our models: one where we have an individual variable for each agent (individual commitment), and another one where the determination of a variable involves pairing the three agents at once (group commitment). Our experiments show that the suitability of the commitment depends on the type of stability we are dealing with, and that the choice of the search heuristic can help improve performance. Our experiments not only brought light to the role that learning and restarts can play in solving this kind of problems, but also allowed us to discover that in some cases combining strong and weak stability leads to reduced runtimes for the latter.<\/jats:p>","DOI":"10.1007\/s10601-022-09335-y","type":"journal-article","created":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T10:03:21Z","timestamp":1654077801000},"page":"249-283","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences"],"prefix":"10.1007","volume":"27","author":[{"given":"\u00c1gnes","family":"Cseh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9029-5671","authenticated-orcid":false,"given":"Guillaume","family":"Escamocher","sequence":"additional","affiliation":[]},{"given":"Beg\u00fcm","family":"Gen\u00e7","sequence":"additional","affiliation":[]},{"given":"Luis","family":"Quesada","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,1]]},"reference":[{"key":"9335_CR1","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1080\/15427951.2008.10129167","volume":"5","author":"DJ Abraham","year":"2008","unstructured":"Abraham, D.J., Levavi, A., Manlove, D.F., & O\u2019Malley, G. (2008). The stable roommates problem with globally-ranked pairs. Internet Mathematics, 5, 493\u2013515.","journal-title":"Internet Mathematics"},{"key":"9335_CR2","doi-asserted-by":"crossref","unstructured":"Alkan, A. (1988). Nonexistence of stable threesome matchings. Mathematical Social Sciences, 16(2), 207\u2013209. https:\/\/www.sciencedirect.com\/science\/article\/pii\/0165489688900534. Accessed May 2022.","DOI":"10.1016\/0165-4896(88)90053-4"},{"key":"9335_CR3","doi-asserted-by":"crossref","unstructured":"Balinski, M., & S\u00f6nmez, T. (1999). A tale of two mechanisms: Student placement. Journal of Economic Theory, 84(1), 73\u201394. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022053198924693. Accessed May 2022.","DOI":"10.1006\/jeth.1998.2469"},{"key":"9335_CR4","doi-asserted-by":"publisher","unstructured":"Bir\u00f3, P., Irving, R.W., & Schlotter, I. (2011). Stable matching with couples: An empirical study. Journal of Experimental Algorithmics (JEA), 16.\u00a0https:\/\/doi.org\/10.1145\/1963190.1970372.","DOI":"10.1145\/1963190.1970372"},{"issue":"1","key":"9335_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00453-009-9315-2","volume":"58","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., & McDermid, E. (2010). Three-sided stable matchings with cyclic preferences. Algorithmica, 58(1), 5\u201318.","journal-title":"Algorithmica"},{"issue":"1-3","key":"9335_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2004.08.012","volume":"289","author":"E Boros","year":"2004","unstructured":"Boros, E., Gurvich, V., Jaslar, S., & Krasner, D. (2004). Stable matchings in three-sided systems with cyclic preferences. Discrete Mathematics, 289 (1-3), 1\u201310.","journal-title":"Discrete Mathematics"},{"key":"9335_CR7","doi-asserted-by":"publisher","unstructured":"Braun, S., Dwenger, N., & K\u00fcbler, D. (2010). Telling the truth may not pay off: An empirical study of centralized university admissions in Germany. The B.E. Journal of Economic Analysis and Policy, 10(1).\u00a0https:\/\/doi.org\/10.2202\/1935-1682.2294.","DOI":"10.2202\/1935-1682.2294"},{"key":"9335_CR8","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1257\/000282802762024728","volume":"92","author":"Y Chen","year":"2002","unstructured":"Chen, Y., & S\u00f6nmez, T. (2002). Improving efficiency of on-campus housing: An experimental study. American Economic Review, 92, 1669\u20131686.","journal-title":"American Economic Review"},{"key":"9335_CR9","unstructured":"Chu, G. (2011). Improving combinatorial optimization. University of Melbourne."},{"issue":"3","key":"9335_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1017\/S147106841600003X","volume":"16","author":"SD Clercq","year":"2016","unstructured":"Clercq, S.D., Schockaert, S., Cock, M.D., & Now\u00e9, A. (2016). Solving stable matching problems using answer set programming. Theory and Practice of Logic Programming, 16(3), 247\u2013268.","journal-title":"Theory and Practice of Logic Programming"},{"key":"9335_CR11","doi-asserted-by":"publisher","unstructured":"Cseh, \u00c1., Escamocher, G., Gen\u00e7, B., & Quesada, L. (2021). A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences. In L.D. Michel (Ed.) 27th International conference on principles and practice of Constraint Programming, CP 2021, Montpellier, France (Virtual Conference), October 25-29, 2021. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.CP.2021.22, (Vol. 210 pp. 22:1\u201322:19).","DOI":"10.4230\/LIPIcs.CP.2021.22"},{"issue":"1","key":"9335_CR12","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.comnet.2012.09.021","volume":"57","author":"L Cui","year":"2013","unstructured":"Cui, L., & Jia, W. (2013). Cyclic stable matching for three-sided networking services. Computer Networks, 57(1), 351\u2013363.","journal-title":"Computer Networks"},{"issue":"2","key":"9335_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0165-4896(03)00073-8","volume":"46","author":"VI Danilov","year":"2003","unstructured":"Danilov, V.I. (2003). Existence of stable matchings in some three-sided systems. Mathematical Social Sciences, 46(2), 145\u2013148.","journal-title":"Mathematical Social Sciences"},{"key":"9335_CR14","unstructured":"Drummond, J., Perrault, A., & Bacchus, F. (2015). SAT is an effective and complete method for solving stable matching problems with couples. In Proceedings of the twenty-fourth international joint conference on artificial intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015 (pp. 518\u2013525). AAAI Press."},{"issue":"2","key":"9335_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1287\/ijoc.1110.0449","volume":"24","author":"P Eirinakis","year":"2012","unstructured":"Eirinakis, P., Magos, D., Mourtos, I., & Miliotis, P. (2012). Finding all stable pairs and solutions to the many-to-many stable matching problem. INFORMS Journal on Computing, 24(2), 245\u2013259.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"9335_CR16","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.mathsocsci.2006.03.005","volume":"52","author":"K Eriksson","year":"2006","unstructured":"Eriksson, K., Sj\u00f6strand, J., & Strimling, P. (2006). Three-dimensional stable matching with cyclic preferences. Mathematical Social Sciences, 52(1), 77\u201387.","journal-title":"Mathematical Social Sciences"},{"key":"9335_CR17","doi-asserted-by":"crossref","unstructured":"Escamocher, G., & O\u2019Sullivan, B. (2018). Three-dimensional matching instances are rich in stable matchings. In Integration of constraint programming, artificial intelligence, and operations research - 15th international conference, CPAIOR 2018, Delft, The Netherlands, June 26-29, 2018, Proceedings, (Vol. 10848 pp. 182\u2013197). Springer.","DOI":"10.1007\/978-3-319-93031-2_13"},{"issue":"2","key":"9335_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0022-0000(92)90048-N","volume":"45","author":"T Feder","year":"1992","unstructured":"Feder, T. (1992). A new fixed point approach for stable networks and stable marriages. Journal of Computer and System Sciences, 45(2), 233\u2013284.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"9335_CR19","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01240738","volume":"11","author":"T Feder","year":"1994","unstructured":"Feder, T. (1994). Network flow and 2-satisfiability. Algorithmica, 11(3), 291\u2013319.","journal-title":"Algorithmica"},{"key":"9335_CR20","doi-asserted-by":"crossref","unstructured":"Gai, A., Lebedev, D., Mathieu, F., de Montgolfier, F., Reynier, J., & Viennot, L. (2007). Acyclic preference systems in P2P networks. In Euro-Par 2007, parallel processing, 13th international euro-par conference, Rennes, France, August 28-31, 2007, Proceedings, (Vol. 4641 pp. 825\u2013834). Springer.","DOI":"10.1007\/978-3-540-74466-5_88"},{"issue":"5","key":"9335_CR21","doi-asserted-by":"publisher","first-page":"386","DOI":"10.4169\/amer.math.monthly.120.05.386","volume":"120","author":"D Gale","year":"2013","unstructured":"Gale, D., & Shapley, L.S. (2013). College admissions and the stability of marriage. The American Mathematical Monthly, 120(5), 386\u2013391.","journal-title":"The American Mathematical Monthly"},{"key":"9335_CR22","unstructured":"Gecode Team. (2019). Gecode: Generic constraint development environment. Available from:\u00a0http:\/\/www.gecode.org. Accessed May 2022."},{"key":"9335_CR23","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Irving, R.W., Manlove, D.F., Prosser, P., & Smith, B.M. (2001). A constraint programming approach to the stable marriage problem. In Principles and practice of constraint programming - CP 2001, 7th international conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings, (Vol. 2239 pp. 225\u2013239). Springer.","DOI":"10.1007\/3-540-45578-7_16"},{"issue":"1","key":"9335_CR24","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0216010","volume":"16","author":"D Gusfield","year":"1987","unstructured":"Gusfield, D. (1987). Three fast algorithms for four problems in stable marriage. SIAM Journal on Computing, 16(1), 111\u2013128.","journal-title":"SIAM Journal on Computing"},{"key":"9335_CR25","unstructured":"Gusfield, D., & Irving, R.W. (1989). The stable marriage problem - structure and algorithms. MIT Press."},{"issue":"1-3","key":"9335_CR26","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/S0304-3975(03)00321-9","volume":"306","author":"MM Halld\u00f3rsson","year":"2003","unstructured":"Halld\u00f3rsson, M.M., Irving, R.W., Iwama, K., Manlove, D.F., Miyazaki, S., Morita, Y., & Scott, S. (2003). Approximability results for stable marriage problems with ties. Theoretical Computer Science, 306(1-3), 431\u2013447.","journal-title":"Theoretical Computer Science"},{"key":"9335_CR27","doi-asserted-by":"crossref","unstructured":"Huang, C. (2007). Two\u2019s company, three\u2019s a crowd: Stable family and threesome roommates problems. In Algorithms - ESA 2007, 15th annual european symposium, Eilat, Israel, October 8-10, 2007, proceedings, (Vol. 4698 pp. 558\u2013569). Springer.","DOI":"10.1007\/978-3-540-75520-3_50"},{"issue":"4","key":"9335_CR28","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"RW Irving","year":"1985","unstructured":"Irving, R.W. (1985). An efficient algorithm for the \u201cstable roommates\u201d problem. Journal of Algorithms, 6(4), 577\u2013595.","journal-title":"Journal of Algorithms"},{"issue":"3","key":"9335_CR29","first-page":"532","volume":"34","author":"RW Irving","year":"1987","unstructured":"Irving, R.W., Leather, P., & Gusfield, D. (1987). An efficient algorithm for the \u201coptimal\u201d stable marriage. Journal of Algorithms, 34(3), 532\u2013543.","journal-title":"Journal of Algorithms"},{"key":"9335_CR30","doi-asserted-by":"crossref","unstructured":"Iwama, K., & Miyazaki, S. (2008). A survey of the stable marriage problem and its variants. In International conference on informatics education and research for knowledge-circulating society (ICKS 2008) (pp. 131\u2013136).","DOI":"10.1109\/ICKS.2008.7"},{"key":"9335_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03167200","volume":"10","author":"A Kato","year":"1993","unstructured":"Kato, A. (1993). Complexity of the sex-equal stable marriage problem. Japan Journal of Industrial and Applied Mathematics, 10, 1\u201319.","journal-title":"Japan Journal of Industrial and Applied Mathematics"},{"key":"9335_CR32","doi-asserted-by":"crossref","unstructured":"Knuth, D.E. (1976). Mariages stables. Les Presses de L\u2019Universit\u00e9 de Montr\u00e9al. (English translation in Stable Marriage and its Relation to Other Combinatorial Problems, volume 10 of CRM Proceedings and Lecture Notes, American Mathematical Society, 1997).","DOI":"10.1090\/crmp\/010"},{"key":"9335_CR33","doi-asserted-by":"crossref","unstructured":"Lam, C., & Plaxton, C.G. (2019). On the existence of three-dimensional stable matchings with cyclic preferences. In Algorithmic game theory - 12th international symposium, SAGT 2019, Athens, Greece, September 30 - October 3, 2019, proceedings, (Vol. 11801 pp. 329\u2013342). Springer.","DOI":"10.1007\/978-3-030-30473-7_22"},{"key":"9335_CR34","doi-asserted-by":"crossref","unstructured":"Manlove, D.F. (2013). Algorithmics of matching under preferences, vol. 2. WorldScientific.","DOI":"10.1142\/8591"},{"key":"9335_CR35","doi-asserted-by":"crossref","unstructured":"Manlove, D.F., O\u2019Malley, G., Prosser, P., & Unsworth, C. (2007). A constraint programming approach to the hospitals \/ residents problem. In Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, 4th international conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings, (Vol. 4510 pp. 155\u2013170). Springer.","DOI":"10.1007\/978-3-540-72397-4_12"},{"issue":"3","key":"9335_CR36","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s00453-012-9672-0","volume":"68","author":"E McDermid","year":"2014","unstructured":"McDermid, E., & Irving, R.W. (2014). Sex-equal stable matchings: Complexity and exact algorithms. Algorithmica, 68(3), 545\u2013570.","journal-title":"Algorithmica"},{"issue":"1","key":"9335_CR37","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1080\/00031305.1978.10479236","volume":"32","author":"R Mcgill","year":"1978","unstructured":"Mcgill, R., Tukey, J.W., & Larsen, W.A. (1978). Variations of box plots. The American Statistician, 32(1), 12\u201316. https:\/\/doi.org\/10.1080\/00031305.1978.10479236.","journal-title":"The American Statistician"},{"key":"9335_CR38","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., & Tack, G. (2007). Minizinc: Towards a standard CP modelling language. In Principles and practice of constraint programming - CP 2007, 13th international conference, CP 2007, Providence, RI, USA, September 23-27, 2007, proceedings, (Vol. 4741 pp. 529\u2013543). Springer.","DOI":"10.1007\/978-3-540-74970-7_38"},{"issue":"2","key":"9335_CR39","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/0404023","volume":"4","author":"C Ng","year":"1991","unstructured":"Ng, C., & Hirschberg, D.S. (1991). Three-dimensional stable matching problems. SIAM Journal on Discrete Mathematics, 4(2), 245\u2013252.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9335_CR40","unstructured":"O\u2019Malley, G. (2007). Algorithmic aspects of stable matching problems (Unpublished doctoral dissertation). University of Glasgow, UK."},{"key":"9335_CR41","unstructured":"Panchal, N., & Sharma, S. (2014). An efficient algorithm for three dimensional cyclic stable matching. International Journal of Engineering Research and Technology, 3(4)."},{"issue":"8","key":"9335_CR42","doi-asserted-by":"publisher","first-page":"2615","DOI":"10.1007\/s11590-020-01557-4","volume":"14","author":"K Pashkovich","year":"2020","unstructured":"Pashkovich, K., & Poirrier, L. (2020). Three-dimensional stable matching with cyclic preferences. Optimization Letters, 14(8), 2615\u20132623.","journal-title":"Optimization Letters"},{"issue":"3-4","key":"9335_CR43","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00182-007-0083-4","volume":"36","author":"N Perach","year":"2008","unstructured":"Perach, N., Polak, J., & Rothblum, U.G. (2008). A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion. International Journal of Game Theory, 36(3-4), 519\u2013535.","journal-title":"International Journal of Game Theory"},{"key":"9335_CR44","doi-asserted-by":"crossref","unstructured":"Raveendran, N., Zha, Y., Zhang, Y., Liu, X., & Han, Z. (2019). Virtual core network resource allocation in 5G systems using three-sided matching. ICC 2019-2019 IEEE international conference on communications (ICC), pp. 1\u20136.","DOI":"10.1109\/ICC.2019.8762095"},{"key":"9335_CR45","doi-asserted-by":"publisher","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-sided matching: A study in game-theoretic modeling and analysis","author":"AE Roth","year":"1990","unstructured":"Roth, A.E., & Sotomayor, M.A.O. (1990). Two-sided matching: A study in game-theoretic modeling and analysis. Cambridge: Cambridge University Press. https:\/\/doi.org\/10.1017\/CCOL052139015X."},{"key":"9335_CR46","doi-asserted-by":"crossref","unstructured":"Siala, M., & O\u2019Sullivan, B. (2016). Revisiting two-sided stability constraints. In International conference on ai and or techniques in constraint programming for combinatorial optimization problems (pp. 342\u2013357).","DOI":"10.1007\/978-3-319-33954-2_25"},{"key":"9335_CR47","doi-asserted-by":"crossref","unstructured":"Siala, M., & O\u2019Sullivan, B. (2017). Rotation-based formulation for stable matching. In International conference on principles and practice of constraint programming (pp. 262\u2013277).","DOI":"10.1007\/978-3-319-66158-2_17"},{"key":"9335_CR48","unstructured":"Stuckey, P.J., Marriott, K., & Tack, G. (2021). The minizinc handbook v2.5.5. Last Accessed on 22 Dec 2021."},{"issue":"4","key":"9335_CR49","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1137\/S0097539789169483","volume":"23","author":"A Subramanian","year":"1994","unstructured":"Subramanian, A. (1994). A new approach to stable matching problems. SIAM Journal on Computing, 23(4), 671\u2013700.","journal-title":"SIAM Journal on Computing"},{"key":"9335_CR50","doi-asserted-by":"crossref","unstructured":"Unsworth, C., & Prosser, P. (2005). A specialised binary constraint for the stable marriage problem. In Abstraction, reformulation and approximation, 6th international symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings, (Vol. 3607 pp. 218\u2013233). Springer.","DOI":"10.1007\/11527862_16"},{"key":"9335_CR51","unstructured":"Unsworth, C., & Prosser, P. (2013). An n-ary constraint for the stable marriage problem. arXiv:1308.0183."},{"key":"9335_CR52","doi-asserted-by":"crossref","unstructured":"Woeginger, G.J. (2013). Core stability in hedonic coalition formation. In Proceedings of SOFSEM 2013, 39th international conference on current trends in theory and practice of computer science, (Vol. 7741 pp. 33\u201350). Springer.","DOI":"10.1007\/978-3-642-35843-2_4"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-022-09335-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-022-09335-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-022-09335-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T12:19:40Z","timestamp":1659961180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-022-09335-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,1]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["9335"],"URL":"https:\/\/doi.org\/10.1007\/s10601-022-09335-y","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,1]]},"assertion":[{"value":"5 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest \/ competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interests\/Competing interests"}}]}}