{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T06:22:00Z","timestamp":1778739720622,"version":"3.51.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,4,30]],"date-time":"2016-04-30T00:00:00Z","timestamp":1461974400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/K01000X\/1"],"award-info":[{"award-number":["EP\/K01000X\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Slovak Scientific grant agency (VEGA)","award":["VEGA 1\/0344\/14"],"award-info":[{"award-number":["VEGA 1\/0344\/14"]}]},{"name":"Student grant","award":["VVGS-PF-2014-463"],"award-info":[{"award-number":["VVGS-PF-2014-463"]}]},{"DOI":"10.13039\/501100003549","name":"OTKA","doi-asserted-by":"crossref","award":["K108383"],"award-info":[{"award-number":["K108383"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007034","name":"Thales","doi-asserted-by":"crossref","award":["MIS 380232"],"award-info":[{"award-number":["MIS 380232"]}],"id":[{"id":"10.13039\/501100007034","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007034","name":"Thales","doi-asserted-by":"crossref","award":["MIS 380232"],"award-info":[{"award-number":["MIS 380232"]}],"id":[{"id":"10.13039\/501100007034","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007034","name":"Thales","doi-asserted-by":"crossref","award":["MIS 380232"],"award-info":[{"award-number":["MIS 380232"]}],"id":[{"id":"10.13039\/501100007034","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/K01000X\/1"],"award-info":[{"award-number":["EP\/K01000X\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"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-9677-1","type":"journal-article","created":{"date-parts":[[2016,4,30]],"date-time":"2016-04-30T06:06:10Z","timestamp":1461996370000},"page":"700-721","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Pareto Optimal Matchings in Many-to-Many Markets with Ties"],"prefix":"10.1007","volume":"59","author":[{"given":"Katar\u00edna","family":"Cechl\u00e1rov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavlos","family":"Eirinakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Fleiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Magos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Manlove","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Mourtos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eva","family":"Ocel\u0306\u00e1kov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baharak","family":"Rastegari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,30]]},"reference":[{"issue":"3","key":"9677_CR1","doi-asserted-by":"crossref","first-page":"689","DOI":"10.2307\/2998580","volume":"66","author":"A Abdulkadirog\u030clu","year":"1998","unstructured":"Abdulkadirog\u030clu, A., S\u00f6nmez, T.: Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica 66(3), 689\u2013701 (1998)","journal-title":"Econometrica"},{"key":"9677_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Cechl\u00e1rov\u00e1, K., Manlove, D.F., Mehlhorn, K.: Pareto optimality in house allocation problems. In: Proc. ISAAC \u201904, volume 3341 of LNCS, pp. 3\u201315. Springer (2004)","DOI":"10.1007\/978-3-540-30551-4_3"},{"key":"9677_CR3","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., Orlin, J. B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Upper Saddle River (1993)"},{"issue":"2","key":"9677_CR4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1006\/jeth.2000.2710","volume":"100","author":"A Bogomolnaia","year":"2001","unstructured":"Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. J. Econ. Theory 100(2), 295\u2013328 (2001)","journal-title":"J. Econ. Theory"},{"issue":"1","key":"9677_CR5","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1111\/j.1468-0262.2004.00483.x","volume":"72","author":"A Bogomolnaia","year":"2004","unstructured":"Bogomolnaia, A., Moulin, H.: Random matching under dichotomous preferences. Econometrica 72(1), 257\u2013279 (2004)","journal-title":"Econometrica"},{"issue":"5","key":"9677_CR6","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.1257\/aer.102.5.2237","volume":"102","author":"E Budish","year":"2012","unstructured":"Budish, E., Cantillon, E.: The multi-unit assignment problem: Theory and evidence from course allocation at harvard. Amer. Econ. Rev. 102(5), 2237\u201371 (2012)","journal-title":"Amer. Econ. Rev."},{"key":"9677_CR7","doi-asserted-by":"crossref","unstructured":"Cechl\u00e1rov\u00e1, K., Eirinakis, P., Fleiner, T., Magos, D., Manlove, D., Mourtos, I., Oce\u013e\u00e1kov\u00e1, E., Rastegari, B.: Pareto optimal matchings in many-to-many markets with ties. In: Proceedings of the Eighth International Symposium on Algorithmic Game Theory (SAGT\u201915), pp. 27\u201339 (2015)","DOI":"10.1007\/978-3-662-48433-3_3"},{"issue":"0","key":"9677_CR8","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.disopt.2014.09.002","volume":"14","author":"K Cechl\u00e1rov\u00e1","year":"2014","unstructured":"Cechl\u00e1rov\u00e1, K., Eirinakis, P., Fleiner, T., Magos, D., Mourtos, I., Potpinkov\u00e1, E.: Pareto optimality in many-to-many matching problems. Discret. Optim. 14(0), 160\u2013169 (2014)","journal-title":"Discret. Optim."},{"key":"9677_CR9","unstructured":"Chen, N., Ghosh, A: Algorithms for Pareto stable assignment. In: Conitzer, V., Rothe, J. (eds.) Proc. COMSOC \u201910, pp 343\u2013354. D\u00fcsseldorf University Press (2010)"},{"key":"9677_CR10","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s101070050058","volume":"85","author":"BV Cherkassky","year":"1999","unstructured":"Cherkassky, B. V., Goldberg, A. V.: Negative-cycle detection algorithms. Math. Program. 85, 227\u2013311 (1999)","journal-title":"Math. Program."},{"key":"9677_CR11","doi-asserted-by":"crossref","unstructured":"Fujita, E., Lesca, J., Sonoda, A., Todo, T., Yokoo, M.: A complexity approach for core-selecting exchange with multiple indivisible goods under lexicographic preferences. In: Proc. AAAI \u201915 (2015)","DOI":"10.1609\/aaai.v29i1.9318"},{"issue":"3","key":"9677_CR12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/mnsc.20.3.331","volume":"20","author":"P G\u00e4rdenfors","year":"1973","unstructured":"G\u00e4rdenfors, P.: Assignment problem based on ordinal preferences. Manag. Sci. 20(3), 331\u2013340 (1973)","journal-title":"Manag. Sci."},{"issue":"4","key":"9677_CR13","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1037\/0033-295X.103.4.650","volume":"103","author":"G Gigerenzer","year":"1996","unstructured":"Gigerenzer, G., Goldstein, D. G.: Reasoning the fast and frugal way: Models of bounded rationality. Psychol. Rev. 103(4), 650\u2013669 (1996)","journal-title":"Psychol. Rev."},{"key":"9677_CR14","unstructured":"Goldberg, A.V.: Scaling algorithms for the shortest paths problem. Technical Report STAN-CS-92-1429, Stanford University (Stanford, CA, US) (1992)"},{"issue":"2","key":"9677_CR15","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1086\/260757","volume":"87","author":"A Hylland","year":"1979","unstructured":"Hylland, A., Zeckhauser, R.: The efficient allocation of individuals to positions. J. Polit. Econ. 87(2), 293\u2013314 (1979)","journal-title":"J. Polit. Econ."},{"key":"9677_CR16","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s001820100088","volume":"30","author":"B Klaus","year":"2001","unstructured":"Klaus, B., Miyagawa, E.: Strategy-proofness, solidarity, and consistency for multiple assignment problems. Int. J .Game Theory 30, 421\u2013435 (2001)","journal-title":"Int. J .Game Theory"},{"key":"9677_CR17","doi-asserted-by":"crossref","unstructured":"Krysta, P., Manlove, D., Rastegari, B., Zhang, J.: Size versus truthfulness in the House Allocation problem. Technical Report 1404.5245, Computing Research Repository, Cornell University Library. A shorter version appeared in the Proceedings of EC\u201914 (2014)","DOI":"10.1145\/2600057.2602868"},{"key":"9677_CR18","doi-asserted-by":"crossref","unstructured":"Manlove, D.F: Algorithmics of Matching Under Preferences. World Scientific (2013)","DOI":"10.1142\/8591"},{"key":"9677_CR19","doi-asserted-by":"crossref","unstructured":"Saban, D., Sethuraman, J.: The complexity of computing the random priority allocation matrix. In: Proc. WINE \u201913, volume 8289 of LNCS, pp. 421. Springer (2013)","DOI":"10.1007\/978-3-642-45046-4_34"},{"issue":"4","key":"9677_CR20","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF00183301","volume":"11","author":"LG Svensson","year":"1994","unstructured":"Svensson, L. G.: Queue allocation of indivisible goods. Soc. Choice Welfare 11 (4), 323\u2013330 (1994)","journal-title":"Soc. Choice Welfare"},{"issue":"1","key":"9677_CR21","doi-asserted-by":"crossref","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. J. Econ\/ Theory 52(1), 123\u2013135 (1990)","journal-title":"J. Econ\/ Theory"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9677-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-016-9677-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9677-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9677-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T21:09:55Z","timestamp":1692306595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-016-9677-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,30]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["9677"],"URL":"https:\/\/doi.org\/10.1007\/s00224-016-9677-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,30]]}}}