{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:49:15Z","timestamp":1725738555452},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_54","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:09:19Z","timestamp":1372770559000},"page":"620-631","source":"Crossref","is-referenced-by-count":6,"title":["Locally Stable Marriage with Strict Preferences"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[]},{"given":"Lisa","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"54_CR1","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1137\/090753498","volume":"40","author":"H. Ackermann","year":"2011","unstructured":"Ackermann, H., Goldberg, P., Mirrokni, V., R\u00f6glin, H., V\u00f6cking, B.: Uncoordinated two-sided matching markets. SIAM J. Comput.\u00a040(1), 92\u2013106 (2011)","journal-title":"SIAM J. Comput."},{"key":"54_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-10841-9_21","volume-title":"Internet and Network Economics","author":"E. Arcaute","year":"2009","unstructured":"Arcaute, E., Vassilvitskii, S.: Social networks and stable matchings in the job market. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 220\u2013231. Springer, Heidelberg (2009)"},{"issue":"1","key":"54_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.4086\/toc.2011.v007a003","volume":"7","author":"P. Austrin","year":"2011","unstructured":"Austrin, P., Khot, S., Safra, M.: Inapproximability of vertex cover and independent set in bounded degree graphs. Theory of Computing\u00a07(1), 27\u201343 (2011)","journal-title":"Theory of Computing"},{"issue":"3-4","key":"54_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00182-007-0084-3","volume":"36","author":"P. Bir\u00f3","year":"2008","unstructured":"Bir\u00f3, P., Cechl\u00e1rov\u00e1, K., Fleiner, T.: The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems. Int. J. Game Theory\u00a036(3-4), 333\u2013352 (2008)","journal-title":"Int. J. Game Theory"},{"key":"54_CR5","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1006\/jeth.1997.2307","volume":"76","author":"Y. Blum","year":"1997","unstructured":"Blum, Y., Roth, A., Rothblum, U.: Vacancy chains and equilibration in senior-level labor markets. J. Econom. Theory\u00a076, 362\u2013411 (1997)","journal-title":"J. Econom. Theory"},{"key":"54_CR6","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1006\/jeth.2001.2885","volume":"103","author":"Y. Blum","year":"2002","unstructured":"Blum, Y., Rothblum, U.: \u201cTiming is everything\u201d and martial bliss. J. Econom. Theory\u00a0103, 429\u2013442 (2002)","journal-title":"J. Econom. Theory"},{"unstructured":"Cheng, C., McDermid, E.: Maximum locally stable matchings. In: Proc. 2nd Intl. Workshop Matching under Preferences (MATCH-UP), pp. 51\u201362 (2012)","key":"54_CR7"},{"issue":"1","key":"54_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.: Random paths to stability in the roommates problem. Games Econom. Behav.\u00a048(1), 18\u201328 (2004)","journal-title":"Games Econom. Behav."},{"issue":"5","key":"54_CR9","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1109\/JSAC.2006.872884","volume":"24","author":"M. Goemans","year":"2006","unstructured":"Goemans, M., Li, L., Mirrokni, V., Thottan, M.: Market sharing games applied to content distribution in ad-hoc networks. IEEE J. Sel. Area Comm.\u00a024(5), 1020\u20131033 (2006)","journal-title":"IEEE J. Sel. Area Comm."},{"unstructured":"Gusfield, D., Irving, R.: The Stable Marriage Problem: Structure and Algorithms. MIT Press (1989)","key":"54_CR10"},{"key":"54_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ic.2012.10.005","volume":"222","author":"M. Hoefer","year":"2013","unstructured":"Hoefer, M.: Local matching dynamics in social networks. Inf. Comput.\u00a0222, 20\u201335 (2013)","journal-title":"Inf. Comput."},{"issue":"3-4","key":"54_CR12","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00182-007-0089-y","volume":"36","author":"E. Inarra","year":"2008","unstructured":"Inarra, E., Larrea, C., Moris, E.: Random paths to P-stability in the roommates problem. Int. J. Game Theory\u00a036(3-4), 461\u2013471 (2008)","journal-title":"Int. J. Game Theory"},{"unstructured":"Inarra, E., Larrea, C., Moris, E.: The stability of the roommate problem revisited. Core Discussion Paper 2010\/7 (2010)","key":"54_CR13"},{"issue":"4","key":"54_CR14","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"R. Irving","year":"1985","unstructured":"Irving, R.: An efficient algorithm for the \u201dstable roommates\u201d problem. J. Algorithms\u00a06(4), 577\u2013595 (1985)","journal-title":"J. Algorithms"},{"key":"54_CR15","doi-asserted-by":"publisher","first-page":"2218","DOI":"10.1016\/j.jet.2010.07.006","volume":"145","author":"B. Klaus","year":"2010","unstructured":"Klaus, B., Klijn, F., Walzl, M.: Stochastic stability for rommate markets. J. Econom. Theory\u00a0145, 2218\u20132240 (2010)","journal-title":"J. Econom. Theory"},{"unstructured":"Knuth, D.: Marriages stables et leurs relations avec d\u2019autres problemes combinatoires. Les Presses de l\u2019Universit\u00e9 de Montr\u00e9al (1976)","key":"54_CR16"},{"key":"54_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/978-3-642-02927-1_57","volume-title":"Automata, Languages and Programming","author":"E. McDermid","year":"2009","unstructured":"McDermid, E.: A 3\/2-approximation algorithm for general stable marriage. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 689\u2013700. Springer, Heidelberg (2009)"},{"issue":"2","key":"54_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","volume":"125","author":"A. Roth","year":"2005","unstructured":"Roth, A., S\u00f6nmezc, T., \u00dcnver, M.U.: Pairwise kidney exchange. J. Econom. Theory\u00a0125(2), 151\u2013188 (2005)","journal-title":"J. Econom. Theory"},{"doi-asserted-by":"crossref","unstructured":"Roth, A., Sotomayor, M.O.: Two-sided Matching: A study in game-theoretic modeling and analysis. Cambridge University Press (1990)","key":"54_CR19","DOI":"10.1017\/CCOL052139015X"},{"issue":"6","key":"54_CR20","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.2307\/2938326","volume":"58","author":"A. Roth","year":"1990","unstructured":"Roth, A., Vate, J.V.: Random paths to stability in two-sided matching. Econometrica\u00a058(6), 1475\u20131480 (1990)","journal-title":"Econometrica"},{"unstructured":"Yanagisawa, H.: Approximation algorithms for stable marriage problems. PhD thesis, Kyoto University, Graduate School of Informatics (2007)","key":"54_CR21"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T09:30:11Z","timestamp":1557912611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}