{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:30:49Z","timestamp":1787499049353,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540359043","type":"print"},{"value":"9783540359050","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_62","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T06:46:45Z","timestamp":1151477205000},"page":"715-726","source":"Crossref","is-referenced-by-count":38,"title":["Weighted Popular Matchings"],"prefix":"10.1007","author":[{"given":"Juli\u00e1n","family":"Mestre","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"62_CR1","doi-asserted-by":"crossref","first-page":"689","DOI":"10.2307\/2998580","volume":"66","author":"A. Abdulkadiro\u01e7lu","year":"1998","unstructured":"Abdulkadiro\u01e7lu, A., S\u00f6nmez, T.: Random serial dictatorship and the core from random endowments in house allocation problems. Econ.\u00a066(3), 689\u2013701 (1998)","journal-title":"Econ."},{"key":"62_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-30551-4_3","volume-title":"Algorithms and Computation","author":"D.J. Abraham","year":"2004","unstructured":"Abraham, D.J., Cechlarova, K., Manlove, D.F., Mehlhorn, K.: Pareto optimality in house allocation problems. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 3\u201315. Springer, Heidelberg (2004)"},{"key":"62_CR3","unstructured":"Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. In: Proc. of SODA, pp. 424\u2013432 (2005)"},{"key":"62_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11785293_9","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"D.J. Abraham","year":"2006","unstructured":"Abraham, D.J., Kavitha, T.: Dynamic matching markets and voting paths. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, Springer, Heidelberg (2006)"},{"key":"62_CR5","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/bs.3830200304","volume":"20","author":"P. Gardenfors","year":"1975","unstructured":"Gardenfors, P.: Match making: assignments based on bilateral preferences. Behavioural Sciences\u00a020, 166\u2013173 (1975)","journal-title":"Behavioural Sciences"},{"issue":"2","key":"62_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1086\/260757","volume":"87","author":"A. Hylland","year":"1979","unstructured":"Hylland, A., Zeeckhauser, R.: The efficient allocation of individuals to positions. Journal of Political Economy\u00a087(2), 293\u2013314 (1979)","journal-title":"Journal of Political Economy"},{"key":"62_CR7","unstructured":"Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: Rank-maximal matchings. In: Proc. of SODA, pp. 68\u201375 (2004)"},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Mahdian, M.: Random popular matchings. In: EC (to appear, 2006)","DOI":"10.1145\/1134707.1134733"},{"key":"62_CR9","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/0377-2217(94)00358-0","volume":"90","author":"Y. Yuan","year":"1996","unstructured":"Yuan, Y.: Residence exchange wanted: a stable residence exchange problem. European Journal of Operational Research\u00a090, 536\u2013546 (1996)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"62_CR10","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0022-0531(90)90070-Z","volume":"52","author":"L. Zhou","year":"1990","unstructured":"Zhou, L.: On a conjecture by Gale about one-sided matching problems. Journal of Economic Theory\u00a052(1), 123\u2013135 (1990)","journal-title":"Journal of Economic Theory"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:19:58Z","timestamp":1619493598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11786986_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}