{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:00Z","timestamp":1759847760367,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T00:00:00Z","timestamp":1550707200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003825","name":"Magyar Tudom\u00e1nyos Akad\u00e9mia","doi-asserted-by":"publisher","award":["J\u00e1nos Bolyai Research Fellowhip"],"award-info":[{"award-number":["J\u00e1nos Bolyai Research Fellowhip"]}],"id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Game Theory"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00182-019-00664-6","type":"journal-article","created":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T16:15:15Z","timestamp":1550765715000},"page":"835-862","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Paths to stable allocations"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4991-2599","authenticated-orcid":false,"given":"\u00c1gnes","family":"Cseh","sequence":"first","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,21]]},"reference":[{"key":"664_CR1","first-page":"493","volume":"5","author":"DJ Abraham","year":"2008","unstructured":"Abraham DJ, Levavi A, Manlove DF, O\u2019Malley G (2008) The stable roommates problem with globally-ranked pairs. Int Math 5:493\u2013515","journal-title":"Int Math"},{"key":"664_CR2","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1137\/090753498","volume":"40","author":"H Ackermann","year":"2011","unstructured":"Ackermann H, Goldberg PW, Mirrokni VS, R\u00f6glin H, V\u00f6cking B (2011) Uncoordinated two-sided matching markets. SIAM J Comput 40:92\u2013106","journal-title":"SIAM J Comput"},{"key":"664_CR3","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1287\/moor.27.4.662.302","volume":"27","author":"M Ba\u00efou","year":"2002","unstructured":"Ba\u00efou M, Balinski M (2002) Erratum: the stable allocation (or ordinal transportation) problem. Math Oper Res 27:662\u2013680","journal-title":"Math Oper Res"},{"key":"664_CR4","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1006\/jeth.1997.2307","volume":"76","author":"Y Blum","year":"1997","unstructured":"Blum Y, Roth AE, Rothblum UG (1997) Vacancy chains and equilibration in senior-level labor markets. J Econ Theory 76:362\u2013411","journal-title":"J Econ Theory"},{"key":"664_CR5","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1006\/jeth.2001.2885","volume":"103","author":"Y Blum","year":"2002","unstructured":"Blum Y, Rothblum UG (2002) \u201cTiming is everything\u201d and marital bliss. J Econ Theory 103:429\u2013443","journal-title":"J Econ Theory"},{"key":"664_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.jet.2016.04.003","volume":"165","author":"B Chen","year":"2016","unstructured":"Chen B, Fujishige S, Yang Z (2016) Random decentralized market processes for stable job matchings with competitive salaries. J Econ Theory 165:25\u201336","journal-title":"J Econ Theory"},{"key":"664_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00453-010-9416-y","volume":"58","author":"BC Dean","year":"2010","unstructured":"Dean BC, Munshi S (2010) Faster algorithms for stable allocation problems. Algorithmica 58:59\u201381","journal-title":"Algorithmica"},{"key":"664_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.geb.2003.05.003","volume":"48","author":"E Diamantoudi","year":"2004","unstructured":"Diamantoudi E, Miyagawa E, Xue L (2004) Random paths to stability in the roommate problem. Games Econ Behav 48:18\u201328","journal-title":"Games Econ Behav"},{"key":"664_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/a7010001","volume":"7","author":"T Fleiner","year":"2014","unstructured":"Fleiner T (2014) On stable matchings and flows. Algorithms 7:1\u201314","journal-title":"Algorithms"},{"key":"664_CR10","doi-asserted-by":"crossref","DOI":"10.1515\/9781400875184","volume-title":"Flows in Networks","author":"LR Ford","year":"1962","unstructured":"Ford LR, Fulkerson DR (1962) Flows in Networks. Princeton University Press, Princeton"},{"key":"664_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69:9\u201315","journal-title":"Am Math Mon"},{"key":"664_CR12","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1109\/JSAC.2006.872884","volume":"24","author":"MX Goemans","year":"2006","unstructured":"Goemans MX, Li EL, Mirrokni VS, Thottan M (2006) Market sharing games applied to content distribution in ad hoc networks. IEEE J Sel Areas Commun 24:1020\u20131033","journal-title":"IEEE J Sel Areas Commun"},{"key":"664_CR13","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield D, Irving RW (1989) The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge"},{"doi-asserted-by":"crossref","unstructured":"Hoefer M, Wagner L (2014) Matching dynamics with constraints. In: Liu T-Y, Qi Q, Ye Y (eds) 10th International Conference on Web and Internet Economics (WINE). Springer International Publishing, pp 161\u2013174","key":"664_CR14","DOI":"10.1007\/978-3-319-13129-0_12"},{"key":"664_CR15","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.geb.2006.03.002","volume":"58","author":"B Klaus","year":"2007","unstructured":"Klaus B, Klijn F (2007) Paths to stability for matching markets with couples. Games Econ Behav 58:154\u2013171","journal-title":"Games Econ Behav"},{"doi-asserted-by":"crossref","unstructured":"Knuth D (1997) Mariages stables. Les Presses de L\u2019Universit\u00e9 de Montr\u00e9al, 1976. English translation in Stable Marriage and its Relation to Other Combinatorial Problems, volume 10 of CRM Proceedings and Lecture Notes. American Mathematical Society","key":"664_CR16","DOI":"10.1090\/crmp\/010"},{"issue":"3\u20134","key":"664_CR17","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s00182-006-0037-2","volume":"36","author":"F Kojima","year":"2008","unstructured":"Kojima F, \u00dcnver M (2008) Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration. Int J Game Theory 36(3\u20134):473\u2013488","journal-title":"Int J Game Theory"},{"issue":"1","key":"664_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00355-018-1108-6","volume":"51","author":"B Mill\u00e1n","year":"2018","unstructured":"Mill\u00e1n B, Risma EP (2018) Random path to stability in a decentralized market with contracts. Soc Choice Welf 51(1):79\u2013103","journal-title":"Soc Choice Welf"},{"key":"664_CR19","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.2307\/2938326","volume":"58","author":"AE Roth","year":"1990","unstructured":"Roth AE, Vande Vate J\u00a0H (1990) Random paths to stability in two-sided matching. Econometrica 58:1475\u20131480","journal-title":"Econometrica"},{"issue":"4","key":"664_CR20","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1287\/trsc.2017.0768","volume":"52","author":"X Wang","year":"2017","unstructured":"Wang X, Agatz N, Erera A (2017) Stable matching for dynamic ride-sharing systems. Transp Sci 52(4):850\u2013867","journal-title":"Transp Sci"},{"issue":"1","key":"664_CR21","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0304-3975(95)00022-O","volume":"148","author":"U Zwick","year":"1995","unstructured":"Zwick U (1995) The smallest networks on which the Ford\u2013Fulkerson maximum flow procedure may fail to terminate. Theor Comput Sci 148(1):165\u2013170","journal-title":"Theor Comput Sci"}],"container-title":["International Journal of Game Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00182-019-00664-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-019-00664-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-019-00664-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,28]],"date-time":"2020-11-28T09:22:53Z","timestamp":1606555373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00182-019-00664-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,21]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["664"],"URL":"https:\/\/doi.org\/10.1007\/s00182-019-00664-6","relation":{},"ISSN":["0020-7276","1432-1270"],"issn-type":[{"type":"print","value":"0020-7276"},{"type":"electronic","value":"1432-1270"}],"subject":[],"published":{"date-parts":[[2019,2,21]]},"assertion":[{"value":"17 February 2019","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}