Editorial: Special Issue on Matching under Preferences

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