{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:37Z","timestamp":1725511777322},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_39","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"453-464","source":"Crossref","is-referenced-by-count":1,"title":["Cheating to Get Better Roommates in a Random Stable Matching"],"prefix":"10.1007","author":[{"given":"Chien-Chung","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0166-218X(87)90059-X","volume":"16","author":"G. Demange","year":"1987","unstructured":"Demange, G., Gale, D., Sotomayor, M.: A further note on the stable matching problem. Discrete Applied Mathematics\u00a016, 217\u2013222 (1987)","journal-title":"Discrete Applied Mathematics"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"485","DOI":"10.2307\/2321753","volume":"88","author":"L. Dubins","year":"1981","unstructured":"Dubins, L., Freedman, D.: Machiavelli and the Gale-Shapley algorithm. American Mathematical Monthly\u00a088, 485\u2013494 (1981)","journal-title":"American Mathematical Monthly"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0022-0000(92)90048-N","volume":"1","author":"T. Feder","year":"1992","unstructured":"Feder, T.: A new fixed point approach for stable networks and stable marriages. Journal of Computer and System Sciences\u00a01, 233\u2013294 (1992)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"39_CR4","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(1), 9\u201315 (1962)","journal-title":"American Mathematical Monthly"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.2307\/2323645","volume":"92","author":"D. Gale","year":"1985","unstructured":"Gale, D., Sotomayor, M.: Ms. Machiavelli and the stable matching problem. American Mathematical Monthly\u00a092, 261\u2013268 (1985)","journal-title":"American Mathematical Monthly"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(85)90074-5","volume":"11","author":"D. Gale","year":"1985","unstructured":"Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discrete Applied Mathematics\u00a011, 223\u2013232 (1985)","journal-title":"Discrete Applied Mathematics"},{"key":"39_CR7","volume-title":"The Stable Marriage Problem","author":"D. Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.: The Stable Marriage Problem. MIT Press, Cambridge (1989)"},{"key":"39_CR8","unstructured":"Huang, C.-C.: Cheating to get better roomates in a random stable matching. Technical Report TR2006-582, Computer Science Department, Dartmouth College (2006)"},{"key":"39_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_39","volume-title":"Algorithms \u2013 ESA 2006","author":"C.-C. Huang","year":"2006","unstructured":"Huang, C.-C.: Men cheating in the Gale-Shapley stable matching algorithm. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, Springer, Heidelberg (2006)"},{"key":"39_CR10","first-page":"53","volume-title":"Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"N. Immorlica","year":"2005","unstructured":"Immorlica, N., Mahdian, M.: Marriage, honesty, and stability. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 53\u201362. ACM Press, New York (2005)"},{"key":"39_CR11","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 stable room-mates problem. Journal of Algorithms\u00a06, 577\u2013595 (1985)","journal-title":"Journal of Algorithms"},{"key":"39_CR12","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":"39_CR13","volume-title":"Mariages stables et leurs relations avec d\u2019autre probl\u00e8mes combinatoires","author":"D. Knuth","year":"1976","unstructured":"Knuth, D.: Mariages stables et leurs relations avec d\u2019autre probl\u00e8mes combinatoires. Les Presses de l\u2019universit\u00e9 de Montr\u00e9al, Montr\u00e9al (1976)"},{"key":"39_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-sided matching: A study in game-theorectic modeling and analysis","author":"A. Roth","year":"1990","unstructured":"Roth, A., Sotomayor, M.: Two-sided matching: A study in game-theorectic modeling and analysis. Cambridge University Press, Cambridge (1990)"},{"key":"39_CR15","unstructured":"Sethuraman, J.: Private communication (2006)"},{"key":"39_CR16","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1287\/mnsc.47.9.1252.9784","volume":"47","author":"C.-P. Teo","year":"2001","unstructured":"Teo, C.-P., Sethuraman, J., Tan, W.-P.: Gale-Shapley stable marriage problem revisited: Strategic issues and applications. Management Science\u00a047, 1252\u20131267 (2001)","journal-title":"Management Science"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:53Z","timestamp":1605762713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_39","relation":{},"subject":[]}}