FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2080201224> ?p ?o ?g. }

• W2080201224 endingPage "205" @default.
• W2080201224 startingPage "203" @default.
• W2080201224 abstract "first_page settings Order Article Reprints Font Type: Arial Georgia Verdana Font Size: Aa Aa Aa Line Spacing:    Column Width:    Background: Open AccessEditorial Editorial: Special Issue on Matching under Preferences by Péter Biró 1,† and David F. Manlove 2,*,‡ 1 Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences, 1112 Budaörsi út 45, Budapest, Hungary 2 School of Computing Science, Sir Alwyn Williams Building, University of Glasgow, Glasgow G12 8QQ, UK * Author to whom correspondence should be addressed. † Supported by the Hungarian Academy of Sciences under its Momentum Programme (LD-004/2010) and also by OTKA grant no. K108673. ‡ Supported by grant EP/K010042/1 from the Engineering and Physical Sciences Research Council. Algorithms 2014, 7(2), 203-205; https://doi.org/10.3390/a7020203 Received: 14 March 2014 / Accepted: 14 March 2014 / Published: 8 April 2014 (This article belongs to the Special Issue Special Issue on Matching under Preferences) Download Download PDF Download PDF with Cover Download XML Download Epub Versions Notes Abstract: This special issue of Algorithms is devoted to the study of matching problems involving ordinal preferences from the standpoint of algorithms and complexity. Keywords: stable marriage problem; hospitals/residents problem; stable roommates problem; optimal matching; stable matching; stable flow; algorithms and complexity 1. IntroductionMatching problems with preferences occur in widespread applications, such as the assignment of school-leavers to universities, junior doctors to hospitals, students to campus housing, children to schools, kidney transplant patients to donors and so on. The common thread is that individuals have ordinal preferences over the possible outcomes and the task is to find a matching of the participants that is in some sense optimal with respect to these preferences. Due to the large numbers of agents typically involved in such applications, efficient algorithms are of paramount importance.These types of problems can generally be categorized according to whether the problem is bipartite or non-bipartite. In the former case there are two disjoint sets of agents who seek to become matched to one another. Typical examples include the Stable Marriage, Hospitals/Residents and House Allocation problems, which have applications in school choice, for example. Non-bipartite matching problems involve a single set of agents seeking to become matched within themselves, and a typical problem in this category is the Stable Roommates problem, which has applications in kidney exchange, P2P networking and tournament design. 2. Special IssueThis special issue focuses on matching problems involving preferences from an algorithms and complexity point of view. The call for papers was issued following the workshop MATCH-UP 2012: the Second International Workshop on Matching Under Preferences, which took place in Budapest on 19–20 July 2012. Hence some of the papers appearing in this issue are fully revised and extended versions of papers that appeared in the informal workshop proceedings. However, submission to the special issue was not restricted to papers that appeared at this workshop. In response to the call for papers, we received a total of 15 submissions. All submissions were reviewed by experts. We selected 11 submissions for the special issue, all of which are of high quality, reflecting the growing interest in the area of matching under preferences in the community. The final versions of these articles were published as [1,2,3,4,5,6,7,8,9,10,11]. AcknowledgmentsWe would firstly like to thank the authors of all submitted papers for their contributions. In particular we thank the authors of accepted papers for their efforts in making revisions subject to the reviewers’ comments in a timely fashion. We would also like to express our gratitude to the reviewers for their detailed and helpful reports. Finally we would like to thank our colleagues connected with the journal, namely Kazuo Iwama, Editor-in-Chief, for suggesting that we put together this special issue, and also Chelly Cheng, Assistant Editor, for all her help and support with the editorial process.Conflicts of InterestThe authors declare no conflict of interest.ReferencesKirály, T.; Pap, J. Stable Multicommodity Flows. Algorithms 2013, 6, 161–168. [Google Scholar] [CrossRef]Inoshita, T.; Irving, R.W.; Iwama, K.; Miyazaki, S.; Nagase, T. Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists. Algorithms 2013, 6, 371–382. [Google Scholar] [CrossRef]Cheng, C.T.; McDermid, E. Maximum Locally Stable Matchings. Algorithms 2013, 6, 383–395. [Google Scholar] [CrossRef]Király, Z. Linear Time Local Approximation Algorithm for Maximum Stable Marriage. Algorithms 2013, 6, 471–484. [Google Scholar] [CrossRef]Cseh, Á.; Matuschke, J.; Skutella, M. Stable Flows over Time. Algorithms 2013, 6, 532–545. [Google Scholar] [CrossRef]Gelain, M.; Pini, M.S.; Rossi, F.; Venable, K.B.; Walsh, T. Local Search Approaches in Stable Matching Problems. Algorithms 2013, 6, 591–617. [Google Scholar] [CrossRef]Pini, M.S.; Rossi, F.; Venable, K.B.; Walsh, T. Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences. Algorithms 2013, 6, 782–804. [Google Scholar] [CrossRef]Georgiadis, G.; Papatriantafilou, M. Overlays with Preferences: Distributed, Adaptive Approximation Algorithms for Matching with Preference Lists. Algorithms 2013, 6, 824–856. [Google Scholar] [CrossRef]Fleiner, T. On Stable Matchings and Flows. Algorithms 2014, 7, 1–14. [Google Scholar] [CrossRef][Green Version]Fleiner, T.; Jankó, Z. Choice Function-Based Two-Sided Markets: Stability, Lattice Property, Path Independence and Algorithms. Algorithms 2014, 7, 32–59. [Google Scholar] [CrossRef][Green Version]Paluch, K. Faster and Simpler Approximation of Stable Matchings. Algorithms 2014, 7, 189–202. [Google Scholar] [CrossRef] © 2014 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/). Share and Cite MDPI and ACS Style Biró, P.; Manlove, D.F. Editorial: Special Issue on Matching under Preferences. Algorithms 2014, 7, 203-205. https://doi.org/10.3390/a7020203 AMA Style Biró P, Manlove DF. Editorial: Special Issue on Matching under Preferences. Algorithms. 2014; 7(2):203-205. https://doi.org/10.3390/a7020203 Chicago/Turabian Style Biró, Péter, and David F. Manlove. 2014. Editorial: Special Issue on Matching under Preferences Algorithms 7, no. 2: 203-205. https://doi.org/10.3390/a7020203 Find Other Styles Article Metrics No No Article Access Statistics For more information on the journal statistics, click here. Multiple requests from the same IP address are counted as one view." @default.
• W2080201224 created "2016-06-24" @default.
• W2080201224 creator A5003459884 @default.
• W2080201224 creator A5050695548 @default.
• W2080201224 date "2014-04-08" @default.
• W2080201224 modified "2023-09-25" @default.
• W2080201224 title "Editorial: Special Issue on Matching under Preferences" @default.
• W2080201224 cites W1984454127 @default.
• W2080201224 cites W2001236072 @default.
• W2080201224 cites W2005066278 @default.
• W2080201224 cites W2019340823 @default.
• W2080201224 cites W2047128428 @default.
• W2080201224 cites W2048353104 @default.
• W2080201224 cites W2049562645 @default.
• W2080201224 cites W2073547397 @default.
• W2080201224 cites W2074498497 @default.
• W2080201224 cites W2150787783 @default.
• W2080201224 cites W2152327218 @default.
• W2080201224 doi "https://doi.org/10.3390/a7020203" @default.
• W2080201224 hasPublicationYear "2014" @default.
• W2080201224 type Work @default.
• W2080201224 sameAs 2080201224 @default.
• W2080201224 citedByCount "0" @default.
• W2080201224 crossrefType "journal-article" @default.
• W2080201224 hasAuthorship W2080201224A5003459884 @default.
• W2080201224 hasAuthorship W2080201224A5050695548 @default.
• W2080201224 hasBestOaLocation W20802012241 @default.
• W2080201224 hasConcept C105795698 @default.
• W2080201224 hasConcept C126042441 @default.
• W2080201224 hasConcept C136764020 @default.
• W2080201224 hasConcept C161191863 @default.
• W2080201224 hasConcept C165064840 @default.
• W2080201224 hasConcept C2780154274 @default.
• W2080201224 hasConcept C2780551164 @default.
• W2080201224 hasConcept C33923547 @default.
• W2080201224 hasConcept C41008148 @default.
• W2080201224 hasConcept C42475967 @default.
• W2080201224 hasConcept C76155785 @default.
• W2080201224 hasConceptScore W2080201224C105795698 @default.
• W2080201224 hasConceptScore W2080201224C126042441 @default.
• W2080201224 hasConceptScore W2080201224C136764020 @default.
• W2080201224 hasConceptScore W2080201224C161191863 @default.
• W2080201224 hasConceptScore W2080201224C165064840 @default.
• W2080201224 hasConceptScore W2080201224C2780154274 @default.
• W2080201224 hasConceptScore W2080201224C2780551164 @default.
• W2080201224 hasConceptScore W2080201224C33923547 @default.
• W2080201224 hasConceptScore W2080201224C41008148 @default.
• W2080201224 hasConceptScore W2080201224C42475967 @default.
• W2080201224 hasConceptScore W2080201224C76155785 @default.
• W2080201224 hasIssue "2" @default.
• W2080201224 hasLocation W20802012241 @default.
• W2080201224 hasLocation W20802012242 @default.
• W2080201224 hasLocation W20802012243 @default.
• W2080201224 hasOpenAccess W2080201224 @default.
• W2080201224 hasPrimaryLocation W20802012241 @default.
• W2080201224 hasRelatedWork W2129126521 @default.
• W2080201224 hasRelatedWork W2361944761 @default.
• W2080201224 hasRelatedWork W2361976850 @default.
• W2080201224 hasRelatedWork W2363160663 @default.
• W2080201224 hasRelatedWork W2368676408 @default.
• W2080201224 hasRelatedWork W2391408860 @default.
• W2080201224 hasRelatedWork W2807343911 @default.
• W2080201224 hasRelatedWork W2898942020 @default.
• W2080201224 hasRelatedWork W3125941311 @default.
• W2080201224 hasRelatedWork W4243255096 @default.
• W2080201224 hasVolume "7" @default.
• W2080201224 isParatext "false" @default.
• W2080201224 isRetracted "false" @default.
• W2080201224 magId "2080201224" @default.
• W2080201224 workType "editorial" @default.