Editorial: Special Issue on Matching under Preferences
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
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.
Author to whom correspondence should be addressed.
Received: 14 March 2014 / Accepted: 14 March 2014 / Published: 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.
This is an open access article distributed under the Creative Commons Attribution License
(CC BY 3.0).
Scifeed alert for new publications
Never miss any articles
matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
Define your Scifeed now
Share & Cite This Article
MDPI and ACS Style
Biró, P.; Manlove, D.F. Editorial: Special Issue on Matching under Preferences. Algorithms 2014, 7, 203-205.
Biró P, Manlove DF. Editorial: Special Issue on Matching under Preferences. Algorithms. 2014; 7(2):203-205.
Biró, Péter; Manlove, David F. 2014. "Editorial: Special Issue on Matching under Preferences." Algorithms 7, no. 2: 203-205.
Show more citation formats
Show less citations formats
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.