{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:26:49Z","timestamp":1725794809447},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319078892"},{"type":"electronic","value":"9783319078908"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07890-8_26","type":"book-chapter","created":{"date-parts":[[2014,5,28]],"date-time":"2014-05-28T16:08:51Z","timestamp":1401293331000},"page":"301-312","source":"Crossref","is-referenced-by-count":1,"title":["Counting Houses of Pareto Optimal Matchings in the House Allocation Problem"],"prefix":"10.1007","author":[{"given":"Andrei","family":"Asinowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bal\u00e1zs","family":"Keszegh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tillmann","family":"Miltzow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"MATCH-UP 2012: The Second International Workshop on Matching Under Preferences. Corvinus University of Budapest, Hungary (2012)"},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"689","DOI":"10.2307\/2998580","volume":"66","author":"A. Abdulkadiro\u011flu","year":"1998","unstructured":"Abdulkadiro\u011flu, A., S\u00f6nmez, T.: Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica\u00a066(3), 689\u2013701 (1998)","journal-title":"Econometrica"},{"key":"26_CR3","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., Cechl\u00e1rov\u00e1, 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)"},{"issue":"3","key":"26_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.econlet.2013.09.006","volume":"121","author":"H. Aziz","year":"2013","unstructured":"Aziz, H., Brandt, F., Brill, M.: The computational complexity of random serial dictatorship. Economics Letters\u00a0121(3), 341\u2013345 (2013)","journal-title":"Economics Letters"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Aziz, H., Mestre, J.: Parametrized algorithms for random serial dictatorship. arXiv preprint arXiv:1403.0974 (2014)","DOI":"10.1016\/j.mathsocsci.2014.07.002"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Cechl\u00e1rov\u00e1, K., Eirinakis, P., Fleiner, T., Magos, D., Mourtos, I., Potpinkov\u00e1, E.: Pareto optimality in many-to-many matching problems. Preprint (2013)","DOI":"10.1016\/j.disopt.2014.09.002"},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. The American Mathematical Monthly\u00a069(1), 9\u201315 (1962)","journal-title":"The American Mathematical Monthly"},{"key":"26_CR8","unstructured":"Henze, M., Jaume, R., Keszegh, B.: On the complexity of the partial least-squares matching voronoi diagram. In: Proceedings of the 29th European Workshop on Computational Geometry (EuroCG), pp. 193\u2013196 (March 2013)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Manlove, D.: Algorithmics of matching under preferences. World Scientific Publishing (2013)","DOI":"10.1142\/8591"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Algorithmic game theory. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"26_CR11","unstructured":"Rote, G.: Partial least-squares point matching under translations. In: 26th European Workshop on Computational Geometry (EuroCG 2010), pp. 249\u2013251 (March 2010)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-45046-4_34","volume-title":"Web and Internet Economics","author":"D. Saban","year":"2013","unstructured":"Saban, D., Sethuraman, J.: The complexity of computing the random priority allocation matrix. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol.\u00a08289, p. 421. Springer, Heidelberg (2013)"},{"key":"26_CR13","unstructured":"Scott, S.: A study of stable marriage problems with ties. PhD thesis. University of Glasgow (2005)"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07890-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:11:26Z","timestamp":1558912286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07890-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078892","9783319078908"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07890-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}