{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:27:23Z","timestamp":1760243243872,"version":"build-2065373602"},"reference-count":11,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2014,4,8]],"date-time":"2014-04-08T00:00:00Z","timestamp":1396915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This special issue of Algorithms is devoted to the study of matching problems involving ordinal preferences from the standpoint of algorithms and complexity.<\/jats:p>","DOI":"10.3390\/a7020203","type":"journal-article","created":{"date-parts":[[2014,4,8]],"date-time":"2014-04-08T18:01:43Z","timestamp":1396980103000},"page":"203-205","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Editorial: Special Issue on Matching under Preferences"],"prefix":"10.3390","volume":"7","author":[{"given":"P\u00e9ter","family":"Bir\u00f3","sequence":"first","affiliation":[{"name":"Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences, 1112 Buda\u00f6rsi \u00fat 45, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Manlove","sequence":"additional","affiliation":[{"name":"School of Computing Science, Sir Alwyn Williams Building, University of Glasgow,  Glasgow G12 8QQ, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2014,4,8]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.3390\/a6010161","article-title":"Stable Multicommodity Flows","volume":"6","author":"Pap","year":"2013","journal-title":"Algorithms"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"371","DOI":"10.3390\/a6020371","article-title":"Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists","volume":"6","author":"Inoshita","year":"2013","journal-title":"Algorithms"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"383","DOI":"10.3390\/a6030383","article-title":"Maximum Locally Stable Matchings","volume":"6","author":"Cheng","year":"2013","journal-title":"Algorithms"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"471","DOI":"10.3390\/a6030471","article-title":"Linear Time Local Approximation Algorithm for Maximum Stable Marriage","volume":"6","year":"2013","journal-title":"Algorithms"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"532","DOI":"10.3390\/a6030532","article-title":"Stable Flows over Time","volume":"6","author":"Cseh","year":"2013","journal-title":"Algorithms"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"591","DOI":"10.3390\/a6040591","article-title":"Local Search Approaches in Stable Matching Problems","volume":"6","author":"Gelain","year":"2013","journal-title":"Algorithms"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"782","DOI":"10.3390\/a6040782","article-title":"Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences","volume":"6","author":"Pini","year":"2013","journal-title":"Algorithms"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"824","DOI":"10.3390\/a6040824","article-title":"Overlays with Preferences: Distributed, Adaptive Approximation Algorithms for Matching with Preference Lists","volume":"6","author":"Georgiadis","year":"2013","journal-title":"Algorithms"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/a7010001","article-title":"On Stable Matchings and Flows","volume":"7","author":"Fleiner","year":"2014","journal-title":"Algorithms"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"32","DOI":"10.3390\/a7010032","article-title":"Choice Function-Based Two-Sided Markets: Stability, Lattice Property, Path Independence and Algorithms","volume":"7","author":"Fleiner","year":"2014","journal-title":"Algorithms"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.3390\/a7020189","article-title":"Faster and Simpler Approximation of Stable Matchings","volume":"7","author":"Paluch","year":"2014","journal-title":"Algorithms"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/7\/2\/203\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:10:02Z","timestamp":1760217002000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/7\/2\/203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,8]]},"references-count":11,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2014,6]]}},"alternative-id":["a7020203"],"URL":"https:\/\/doi.org\/10.3390\/a7020203","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2014,4,8]]}}}