Next Article in Journal
Stochastic Diffusion Search: A Comparison of Swarm Intelligence Parameter Estimation Algorithms with RANSAC
Previous Article in Journal / Special Issue
Faster and Simpler Approximation of Stable Matchings
Algorithms 2014, 7(2), 203-205; doi:10.3390/a7020203
Editorial

Editorial: Special Issue on Matching under Preferences

1,†
 and
2,‡,*
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 PDF [29 KB, 9 April 2014; original version 8 April 2014]

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 stable marriage problem; hospitals/residents problem; stable roommates problem; optimal matching; stable matching; stable flow; algorithms and complexity
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote
MDPI and ACS Style

Biró, P.; Manlove, D.F. Editorial: Special Issue on Matching under Preferences. Algorithms 2014, 7, 203-205.

View more citation formats

Article Metrics

For more information on the journal, click here

Comments

Cited By

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert