{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T05:05:12Z","timestamp":1783400712550,"version":"3.54.6"},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7106,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0166-218x(92)00179-p","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:02:11Z","timestamp":1027652531000},"page":"261-272","source":"Crossref","is-referenced-by-count":216,"title":["Stable marriage and indifference"],"prefix":"10.1016","volume":"48","author":[{"given":"Robert W.","family":"Irving","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)00179-P_BIB1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","article-title":"College admissions and the stability of marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0166-218X(92)00179-P_BIB2","series-title":"The Stable Marriage Problem: Structure and Algorithms","author":"Gusfield","year":"1989"},{"key":"10.1016\/0166-218X(92)00179-P_BIB3","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","article-title":"An efficient algorithm for the stable room-mates problem","volume":"6","author":"Irving","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(92)00179-P_BIB4","series-title":"Introduction to Combinatorial Mathematics","author":"Liu","year":"1968"},{"key":"10.1016\/0166-218X(92)00179-P_BIB5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1137\/0219004","article-title":"Lower bounds for the stable marriage problem and its variants","volume":"19","author":"Ng","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)00179-P_BIB6","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0166-218X(92)00179-P_BIB7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0196-6774(90)90007-2","article-title":"NP-complete stable matching problems","volume":"11","author":"Ronn","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(92)00179-P_BIB8","series-title":"Two Sided Matching: A Study in Game-Theoretic Modelling and Analysis","author":"Roth","year":"1990"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9200179P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9200179P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:53:40Z","timestamp":1555199620000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9200179P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0166218X9200179P"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)00179-p","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}