Contact Sitemap Search Login Webmail Magyar
The main website of the Hungarian Academy of Sciences
Research Institutes of the Hungarian Academy of Sciences

MATCH-UP 2012:

the Second International Workshop on Matching Under Preferences

Home | Committees | SubmissionsProgram | Registration | Participants | Venue |


Celebrating the 50th anniversary of the seminal paper by Gale and Shapley, and following the success of the first MATCH-UP workshop, we are organising another interdisciplinary workshop on stable matchings and related topics. The workshop will be co-located with the SING8 conference in Budapest.

Workshop photos

The photos taken by Zsuzsi Jankó are available here.


The proceedings distributed at the workshop can be downloaded from here.


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 remit of this workshop is to explore matching problems with preferences from the perspective of algorithms and complexity, discrete mathematics, combinatorial optimization, game theory, mechanism design and economics, and thus a key objective is to bring together the research communities of the related areas. See more.

Invited speakers

List of topics

  • 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 (roommates problem, kidney exchanges, etc.)
  • matching with payments (assignment game, auctions, etc.)

Important dates

  • Deadline for submission of contributed papers: 19 March 2012
  • Notification of acceptance: 20 April 2012
  • Early registration deadline: 8 June 2012
  • Final versions of papers and abstracts for the proceedings: 1 June 2012  
  • Workshop: 19-20 July 2012

Special issue

A selection of papers presented at the workshop in the algorithms and complexity area will be invited for submission to a special issue of the open-access journal Algorithms, with no article processing charge for the authors of accepted papers.

Contact address

The Institute's
networking infrastructure
is provided by NIIF.
MTA - Magyar Tudományos Akadémia HAS
Hungarian Academy of Sciences
Page last modified: 01 August, 2012