{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:12:22Z","timestamp":1725804742061},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662448021"},{"type":"electronic","value":"9783662448038"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44803-8_3","type":"book-chapter","created":{"date-parts":[[2014,9,5]],"date-time":"2014-09-05T09:45:22Z","timestamp":1409910322000},"page":"25-36","source":"Crossref","is-referenced-by-count":2,"title":["Stable Marriage with General Preferences"],"prefix":"10.1007","author":[{"given":"Linda","family":"Farczadi","sequence":"first","affiliation":[]},{"given":"Konstantinos","family":"Georgiou","sequence":"additional","affiliation":[]},{"given":"Jochen","family":"K\u00f6nemann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","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\u00a037(1), 77\u201391 (2008)","journal-title":"J. Risk Uncertain"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","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\u00a058(1), 5\u201318 (2010)","journal-title":"Algorithmica"},{"key":"3_CR3","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":"3_CR4","doi-asserted-by":"publisher","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.\u00a052(1), 77\u201387 (2006)","journal-title":"Math. Soc. Sci."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Farczadi, L., Georgiou, K., K\u00f6nemann, J.: Stable marriage with general preferences. arXiv preprint arXiv:1407.1853 (2014)","DOI":"10.1007\/978-3-662-44803-8_3"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00056121","volume":"4","author":"P.C. Fishburn","year":"1991","unstructured":"Fishburn, P.C.: Nontransitive preferences in decision theory. J. Risk Uncertain\u00a04(2), 113\u2013134 (1991)","journal-title":"J. Risk Uncertain"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0304-3975(98)00277-1","volume":"217","author":"P.C. Fishburn","year":"1999","unstructured":"Fishburn, P.C.: Preference structures and their numerical representations. Theoretical Computer Science\u00a0217(2), 359\u2013383 (1999)","journal-title":"Theoretical Computer Science"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Amer. Math. Monthly, 9\u201315 (1962)","DOI":"10.1080\/00029890.1962.11989827"},{"issue":"3","key":"3_CR9","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 Appl. Math.\u00a011(3), 223\u2013232 (1985)","journal-title":"Discrete Appl. Math."},{"key":"3_CR10","unstructured":"Gusfield, D., Irving, R.W.: The stable marriage problem: structure and algorithms, vol.\u00a054. MIT Press (1989)"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/1273340.1273346","volume":"3","author":"M.M. Halld\u00f3rsson","year":"2007","unstructured":"Halld\u00f3rsson, M.M., Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation results for the stable marriage problem. TALG\u00a03(3), 30 (2007)","journal-title":"TALG"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00453-009-9356-6","volume":"58","author":"C.C. Huang","year":"2010","unstructured":"Huang, C.C.: Circular stable matching and 3-way kidney transplant. Algorithmica\u00a058(1), 137\u2013150 (2010)","journal-title":"Algorithmica"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"R.W. Irving","year":"1994","unstructured":"Irving, R.W.: Stable marriage and indifference. Discrete Appl. Math.\u00a048(3), 261\u2013272 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","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\u00a068(3), 758\u2013775 (2014)","journal-title":"Algorithmica"},{"key":"3_CR15","volume-title":"Stable marriage and its relation to other combinatorial problems: An introduction to the mathematical analysis of algorithms","author":"D. Knuth","year":"1997","unstructured":"Knuth, D.: Stable marriage and its relation to other combinatorial problems: An introduction to the mathematical analysis of algorithms. Amer. Math. Soc., Providence (1997)"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0166-218X(01)00322-5","volume":"122","author":"D.F. Manlove","year":"2002","unstructured":"Manlove, D.F.: The structure of stable marriage with indifference. Discrete Appl. Math.\u00a0122(1), 167\u2013181 (2002)","journal-title":"Discrete Appl. Math."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Manlove, D.F.: Algorithmics of matching under preferences. World Sci. Publishing (2013)","DOI":"10.1142\/8591"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"D.F. Manlove","year":"2002","unstructured":"Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theor. Comput. Sci.\u00a0276(1), 261\u2013279 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"May, K.O.: Intransitivity, utility, and the aggregation of preference patterns. Econometrica, 1\u201313 (1954)","DOI":"10.2307\/1909827"},{"key":"3_CR20","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)"},{"key":"3_CR21","unstructured":"Roth, A.E., Sotomayor, M.: Two-sided matching: A study in game- theoretic modeling and analysis, vol.\u00a018. Cambridge University Press (1992)"},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0167-6377(89)90041-2","volume":"8","author":"J.H. Vande Vate","year":"1989","unstructured":"Vande Vate, J.H.: Linear programming brings marital bliss. Oper. Res. Lett.\u00a08(3), 147\u2013153 (1989)","journal-title":"Oper. Res. Lett."},{"key":"3_CR23","unstructured":"Yanagisawa, H.: Approximation algorithms for stable marriage problems. Ph.D. thesis, Citeseer (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44803-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:08:36Z","timestamp":1558973316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44803-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662448021","9783662448038"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44803-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}