{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T21:05:41Z","timestamp":1774127141210,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T00:00:00Z","timestamp":1465776000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s00224-016-9687-z","type":"journal-article","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T06:56:47Z","timestamp":1465801007000},"page":"683-699","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Stable Marriage with General Preferences"],"prefix":"10.1007","volume":"59","author":[{"given":"Linda","family":"Farczadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Georgiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jochen","family":"K\u00f6nemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,13]]},"reference":[{"key":"9687_CR1","unstructured":"Abraham, D.: Algorithmics of Two-Sided Matching Problems. M.Sc. Thesis, University of Glasgow (2003)"},{"issue":"1","key":"9687_CR2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s11166-008-9043-z","volume":"37","author":"M Birnbaum","year":"2008","unstructured":"Birnbaum, M., Schmidt, U.: An experimental investigation of violations of transitivity in choice under uncertainty. J Risk Uncertain 37(1), 77\u201391 (2008)","journal-title":"J Risk Uncertain"},{"issue":"1","key":"9687_CR3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00453-009-9315-2","volume":"58","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., McDermid, E.: Three-sided stable matchings with cyclic preferences. Algorithmica 58(1), 5\u201318 (2010)","journal-title":"Algorithmica"},{"key":"9687_CR4","doi-asserted-by":"crossref","unstructured":"Brams, S.J., Gehrlein, W.V., Roberts, F.S.: The mathematics of preference. Choice and Order. Springer (2009)","DOI":"10.1007\/978-3-540-79128-7"},{"issue":"1","key":"9687_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.mathsocsci.2006.03.005","volume":"52","author":"K Eriksson","year":"2006","unstructured":"Eriksson, K., Sj\u00f6strand, J., Strimling, P.: Three-dimensional stable matching with cyclic preferences. Math. Soc. Sci. 52(1), 77\u201387 (2006)","journal-title":"Math. Soc. Sci."},{"key":"9687_CR6","doi-asserted-by":"crossref","unstructured":"Farczadi, L., Georgiou, K., K\u00f6nemann, J.: Stable marriage with general preferences. In: Algorithmic Game Theory, pp 25\u201336. Springer (2014)","DOI":"10.1007\/978-3-662-44803-8_3"},{"key":"9687_CR7","doi-asserted-by":"crossref","unstructured":"Farooq, R., Fleiner, T., Tamura, A.: Matching with partially ordered contracts. Japan Journal of industrial and applied mathematics, pp 401\u2013417. Springer (2012)","DOI":"10.1007\/s13160-012-0073-1"},{"issue":"2","key":"9687_CR8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF00056121","volume":"4","author":"PC Fishburn","year":"1991","unstructured":"Fishburn, P.C.: Nontransitive preferences in decision theory. J Risk Uncertain 4(2), 113\u2013134 (1991)","journal-title":"J Risk Uncertain"},{"issue":"2","key":"9687_CR9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0304-3975(98)00277-1","volume":"217","author":"PC Fishburn","year":"1999","unstructured":"Fishburn, P.C.: Preference structures and their numerical representations. Theor. Comput. Sci. 217(2), 359\u2013383 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"9687_CR10","doi-asserted-by":"crossref","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Amer. Math. Mon., 9\u201315 (1962)","DOI":"10.2307\/2312726"},{"issue":"3","key":"9687_CR11","doi-asserted-by":"crossref","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. Discret. Appl. Math. 11(3), 223\u2013232 (1985)","journal-title":"Discret. Appl. Math."},{"key":"9687_CR12","unstructured":"Gusfield, D., Irving, R.W.: The stable marriage problem: structure and algorithms, vol. 54. MIT Press (1989)"},{"issue":"3","key":"9687_CR13","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/1273340.1273346","volume":"3","author":"MM Halld\u00f3rsson","year":"2007","unstructured":"Halld\u00f3rsson, M.M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation results for the stable marriage problem. TALG 3(3), 30 (2007)","journal-title":"TALG"},{"issue":"1","key":"9687_CR14","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s00453-009-9356-6","volume":"58","author":"CC Huang","year":"2010","unstructured":"Huang, C.C.: Circular stable matching and 3-way kidney transplant. Algorithmica 58(1), 137\u2013150 (2010)","journal-title":"Algorithmica"},{"issue":"3","key":"9687_CR15","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"RW Irving","year":"1994","unstructured":"Irving, R.W.: Stable marriage and indifference. Discret. Appl. Math. 48(3), 261\u2013272 (1994)","journal-title":"Discret. Appl. Math."},{"key":"9687_CR16","doi-asserted-by":"crossref","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: Strong stability in the hospitals\/residents problem. In: STACS 2003, pp 439\u2013450. Springer (2003)","DOI":"10.1007\/3-540-36494-3_39"},{"issue":"3","key":"9687_CR17","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1007\/s00453-012-9699-2","volume":"68","author":"K Iwama","year":"2014","unstructured":"Iwama, K., Miyazaki, S., Yanagisawa, H.: A 25\/17-approximation algorithm for the stable marriage problem with one-sided ties. Algorithmica 68(3), 758\u2013775 (2014)","journal-title":"Algorithmica"},{"key":"9687_CR18","doi-asserted-by":"crossref","unstructured":"Knuth, D.: Stable marriage and its relation to other combinatorial problems: An introduction to the mathematical analysis of algorithms. American Mathematics Society (1997)","DOI":"10.1090\/crmp\/010"},{"issue":"1","key":"9687_CR19","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0166-218X(01)00322-5","volume":"122","author":"DF Manlove","year":"2002","unstructured":"Manlove, D.F.: The structure of stable marriage with indifference. Discret. Appl. Math. 122(1), 167\u2013181 (2002)","journal-title":"Discret. Appl. Math."},{"key":"9687_CR20","doi-asserted-by":"crossref","unstructured":"Manlove, D.F.: Algorithmics of matching under preferences. World Science Publishing (2013)","DOI":"10.1142\/8591"},{"issue":"1","key":"9687_CR21","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"DF Manlove","year":"2002","unstructured":"Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theor. Comput. Sci. 276(1), 261\u2013279 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9687_CR22","doi-asserted-by":"crossref","unstructured":"May, K.O.: Intransitivity, utility, and the aggregation of preference patterns. Econom. J. Econom. Soc., 1\u201313 (1954)","DOI":"10.2307\/1909827"},{"key":"9687_CR23","doi-asserted-by":"crossref","unstructured":"McDermid, E.: A 3\/2-Approximation algorithm for general stable marriage. In: Automata, Languages and Programming, pp 689\u2013700. Springer (2009)","DOI":"10.1007\/978-3-642-02927-1_57"},{"key":"9687_CR24","unstructured":"Roth, A.E., Sotomayor, M.: Two-sided matching: A study in game- theoretic modeling and analysis. No. 18 Cambridge University Press (1992)"},{"key":"9687_CR25","unstructured":"Roth, A.E., Sotomayor, M.: Two-sided matching: A study in game- theoretic modeling and analysis. No. 18 Cambridge University Press (1992)"},{"issue":"3","key":"9687_CR26","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0167-6377(89)90041-2","volume":"8","author":"JH Vande Vate","year":"1989","unstructured":"Vande Vate, J.H.: Linear programming brings marital bliss. Oper. Res. Lett. 8(3), 147\u2013153 (1989)","journal-title":"Oper. Res. Lett."},{"key":"9687_CR27","unstructured":"Yanagisawa, H.: Approximation Algorithms for Stable Marriage Problems. Ph.D. Thesis. Citeseer (2007)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9687-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-016-9687-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9687-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T17:06:01Z","timestamp":1568048761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-016-9687-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,13]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["9687"],"URL":"https:\/\/doi.org\/10.1007\/s00224-016-9687-z","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,13]]}}}