Special Issue "Special Issue on Matching under Preferences"

Quicklinks

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (31 December 2012)

Special Issue Editors

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, 1112 Budaörsi út. 45., Hungary
Website: http://econ.core.hu/english/inst/biro.html
E-Mail: biro.peter@krtk.mta.hu
Phone: +36 309 505 368
Fax: +36 131 931 36
Interests: combinatorial optimization; algorithms; game theory and mechanism design

Special Issue Information

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. This special issue will focus on matching problems involving preferences from an algorithms and complexity standpoint.

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.)

Some of the papers appearing in this issue will be fully revised and extended versions of selected papers that appeared at the workshop MATCH-UP 2012 which took place in Budapest on 19-20 July 2012. However, submission to the special issue is not restricted to papers that appeared at this workshop, provided that they fit the scope of the special issue.

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

Keywords

  • 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

Published Papers (12 papers)

Algorithms 2014, 7(2), 203-205; doi:10.3390/a7020203
Received: 14 March 2014; Accepted: 14 March 2014 / Published: 8 April 2014
Show/Hide Abstract | Download PDF Full-text (29 KB)

Algorithms 2014, 7(2), 189-202; doi:10.3390/a7020189
Received: 5 September 2013; in revised form: 22 March 2014 / Accepted: 27 March 2014 / Published: 4 April 2014
Show/Hide Abstract | Download PDF Full-text (234 KB)

Algorithms 2014, 7(1), 32-59; doi:10.3390/a7010032
Received: 23 June 2013; in revised form: 29 December 2013 / Accepted: 18 January 2014 / Published: 14 February 2014
Show/Hide Abstract | Download PDF Full-text (312 KB)

Algorithms 2014, 7(1), 1-14; doi:10.3390/a7010001
Received: 1 August 2013; in revised form: 9 January 2014 / Accepted: 10 January 2014 / Published: 22 January 2014
Show/Hide Abstract | Download PDF Full-text (231 KB)

Algorithms 2013, 6(4), 824-856; doi:10.3390/a6040824
Received: 21 June 2013; in revised form: 7 November 2013 / Accepted: 8 November 2013 / Published: 19 November 2013
Show/Hide Abstract | Download PDF Full-text (952 KB)

Algorithms 2013, 6(4), 782-804; doi:10.3390/a6040782
Received: 9 July 2013; in revised form: 7 November 2013 / Accepted: 8 November 2013 / Published: 18 November 2013
Show/Hide Abstract | Download PDF Full-text (242 KB)

Algorithms 2013, 6(4), 591-617; doi:10.3390/a6040591
Received: 14 August 2013; in revised form: 4 September 2013 / Accepted: 22 September 2013 / Published: 3 October 2013
Show/Hide Abstract | Download PDF Full-text (454 KB)

Algorithms 2013, 6(3), 532-545; doi:10.3390/a6030532
Received: 31 December 2012; in revised form: 27 July 2013 / Accepted: 9 August 2013 / Published: 21 August 2013
Show/Hide Abstract | Download PDF Full-text (223 KB)

Algorithms 2013, 6(3), 471-484; doi:10.3390/a6030471
Received: 1 August 2013; in revised form: 6 August 2013 / Accepted: 7 August 2013 / Published: 15 August 2013
Show/Hide Abstract | Download PDF Full-text (103 KB)

Algorithms 2013, 6(3), 383-395; doi:10.3390/a6030383
Received: 4 January 2013; in revised form: 2 June 2013 / Accepted: 4 June 2013 / Published: 24 June 2013
Show/Hide Abstract | Download PDF Full-text (187 KB)

Algorithms 2013, 6(2), 371-382; doi:10.3390/a6020371
Received: 27 December 2012; in revised form: 17 May 2013 / Accepted: 20 May 2013 / Published: 28 May 2013
Show/Hide Abstract | Download PDF Full-text (153 KB)

Algorithms 2013, 6(1), 161-168; doi:10.3390/a6010161
Received: 31 December 2012; in revised form: 25 January 2013 / Accepted: 8 March 2013 / Published: 18 March 2013
Show/Hide Abstract | Download PDF Full-text (165 KB)

Last update: 20 February 2014

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert