Editorial: Special Issue on Matching under Preferences

Algorithms

Péter Biró¹  David F. Manlove² 

[1] Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences, 1112 Budaörsi út 45, Budapest, Hungary;School of Computing Science, Sir Alwyn Williams Building, University of Glasgow,Glasgow G12 8QQ, UK;

关键词: stable marriage problem;    hospitals/residents problem;    stable roommates problem;    optimal matching;    stable matching;    stable flow;    algorithms and complexity;   

DOI  :  10.3390/a7020203

来源: DOAJ

【 摘 要 】

This special issue of Algorithms is devoted to the study of matching problems involving ordinal preferences from the standpoint of algorithms and complexity.

【 授权许可】

Unknown