{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:29:41Z","timestamp":1725506981999},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787723"},{"type":"electronic","value":"9783540787730"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78773-0_49","type":"book-chapter","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T04:38:35Z","timestamp":1207197515000},"page":"568-579","source":"Crossref","is-referenced-by-count":5,"title":["The Generalized Median Stable Matchings: Finding Them Is Not That Easy"],"prefix":"10.1007","author":[{"given":"Christine T.","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1257\/000282805774670167","volume":"95","author":"A. Abdulkadiroglu","year":"2005","unstructured":"Abdulkadiroglu, A., Pathak, P., Roth, A.: The New York City high school match. American Economic Review, Papers and Proceedings\u00a095, 364\u2013367 (2005)","journal-title":"American Economic Review, Papers and Proceedings"},{"key":"49_CR2","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1257\/000282805774669637","volume":"95","author":"A. Abdulkadiroglu","year":"2005","unstructured":"Abdulkadiroglu, A., Pathak, P., Roth, A., S\u00f6nmez, T.: The Boston public school match. American Economic Review, Papers and Proceedings\u00a095, 368\u2013371 (2005)","journal-title":"American Economic Review, Papers and Proceedings"},{"key":"49_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0097-3165(84)90056-6","volume":"37","author":"C. Blair","year":"1984","unstructured":"Blair, C.: Every finite distributive lattice is a set of stable matchings. Journal of Combinatorial Theory A\u00a037, 353\u2013356 (1984)","journal-title":"Journal of Combinatorial Theory A"},{"key":"49_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1287\/moor.28.1.103.14256","volume":"28","author":"T. Fleiner","year":"2003","unstructured":"Fleiner, T.: A fixed-point approach to stable matchings and some applications. Mathematics of Operations Research\u00a028, 103\u2013126 (2003)","journal-title":"Mathematics of Operations Research"},{"key":"49_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.: College admissions and the stability of marriage. American Mathematical Monthly\u00a069, 9\u201315 (1962)","journal-title":"American Mathematical Monthly"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0216010","volume":"16","author":"D. Gusfield","year":"1987","unstructured":"Gusfield, D.: Three fast algorithms for four problems in stable marriage. SIAM Journal on Computing\u00a016, 111\u2013128 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"49_CR7","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D. Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.: The Stable Marriage Problem: Structure and Algorithms. The MIT Press, Cambridge (1989)"},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1137\/0215048","volume":"15","author":"R. Irving","year":"1986","unstructured":"Irving, R., Leather, P.: The complexity of counting stable marriages. SIAM Journal on Computing\u00a015, 655\u2013667 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"49_CR9","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1145\/28869.28871","volume":"34","author":"R. Irving","year":"1987","unstructured":"Irving, R., Leather, P., Gusfield, D.: An efficient algorithm for the optimal stable marriage. Journal of the ACM\u00a034, 532\u2013544 (1987)","journal-title":"Journal of the ACM"},{"key":"49_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00182-006-0009-6","volume":"34","author":"B. Klaus","year":"2006","unstructured":"Klaus, B., Klijn, F.: Median stable matchings for college admissions. International Journal of Game Theory\u00a034, 1\u201311 (2006)","journal-title":"International Journal of Game Theory"},{"key":"49_CR11","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00199-004-0602-5","volume":"27","author":"B. Klaus","year":"2006","unstructured":"Klaus, B., Klijn, F.: Procedurally fair and stable matching. Economic Theory\u00a027, 431\u2013447 (2006)","journal-title":"Economic Theory"},{"key":"49_CR12","unstructured":"Knuth, D.: Mariages Stables. Les Presses de l\u2019Universit\u00e9 de Montr\u00e9al (1976)"},{"key":"49_CR13","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"J. Provan","year":"1983","unstructured":"Provan, J., Ball, M.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM Journal on Computing\u00a012, 777\u2013788 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"49_CR14","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1257\/aer.89.4.748","volume":"89","author":"A. Roth","year":"1999","unstructured":"Roth, A., Peranson, E.: The redesign of the matching market of American physicians: Some engineering aspects of economic design. American Economic Review\u00a089, 748\u2013780 (1999)","journal-title":"American Economic Review"},{"key":"49_CR15","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1287\/moor.23.4.874","volume":"23","author":"C.-P. Teo","year":"1998","unstructured":"Teo, C.-P., Sethuraman, J.: The geometry of fractional stable matchings and its applications. Mathematics of Operations Research\u00a023, 874\u2013891 (1998)","journal-title":"Mathematics of Operations Research"}],"container-title":["Lecture Notes in Computer Science","LATIN 2008: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78773-0_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:21:43Z","timestamp":1619508103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78773-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787723","9783540787730"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78773-0_49","relation":{},"subject":[]}}