Special Issue "Selected Papers from MATCH-UP 2012: The Second International Workshop on Matching Under Preferences"

Guest Editor
Dr. David Manlove
School of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK
Website: http://www.dcs.gla.ac.uk/~davidm/
E-Mail: David.Manlove@glasgow.ac.uk
Phone: +44 141 330 2794
Fax: +44 141 330 4913
Interests: design and analysis of algorithms; matching problems, including stable matching; algorithmic graph theory; combinatorial optimization

Guest Editor
Dr. Péter Biró
Hungarian Academy of Sciences, Institute of Economics, Budapest, Buda¨orsi ′ut 45., H-1112, Hungary
Website: http://econ.core.hu/english/inst/staff.html
E-Mail: birop@econ.core.hu
Phone: +36 309 505 368
Fax: +36 131 931 36
Interests: combinatorial optimization; algorithms; game theory and mechanism design

Dear Colleagues,

Matching 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 preference lists 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.

The topics of relevance in this context can be categorised as follows:

• two-sided matchings involving agents on both sides (e.g., college admissions, resident allocation, job markets, school choice, etc.)
• two-sided matchings involving agents and items (e.g., house allocation, course allocation, project allocation, assigning papers to reviewers, school choice, etc.)
• one-sided matchings (e.g., roommates problem, kidney exchanges, etc.)
• matching with payments (e.g., assignment game, auctions, etc.)

The remit of this special issue is to showcase original research on the above matching problems with preferences from the perspective of efficient algorithms and computational complexity.  The papers appearing in this issue will be fully revised and extended versions of selected papers that will appear at the workshop MATCH-UP 2012 (the Second International Workshop on Matching Under Preferences”) which will take place in Budapest on 19-20 July 2012.

Dr. David Manlove
Dr. Péter Biró
Guest Editors

Submission

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. Papers will be published continuously (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are refereed through a peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed Open Access quarterly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 300 CHF (Swiss Francs).

• stable matching problem
• stable marriage problem
• hospitals / residents problem
• stable roommates problem
• house allocation problem
• kidney exchange
• assignment game
• auctions
• mechanism design
• optimal matching
• algorithms and complexity