MATCH-UP 2017, the fourth workshop in the series of interdisciplinary and international workshops on matching under preferences, will take place April 20-21, 2017.
Venue:
Microsoft Research New England
Cambridge, MA 02142
Registration for this event is now closed
Contact us: If you have any questions regarding this event please send email to [email protected]
MATCH-UP 2017 is the fourth workshop in an interdisciplinary and international workshop series (opens in new tab) on matching under preferences.
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.
-
The matching problems under consideration include, but are not limited to:
- Two-sided matchings involving agents on both sides (e.g., college admissions, medical resident allocation, job markets)
- Two-sided matchings involving agents and objects (e.g., house allocation, course allocation, project allocation, assigning papers to reviewers, and school choice)
- One-sided matchings (e.g., roommate problems and kidney exchanges)
- Matching with payments (e.g., assignment games and supply chain/trading network exchange)
-
- Estelle Cantillon, Université libre de Bruxelles
- David Manlove, University of Glasgow
- Michael Ostrovsky, Stanford Graduate School of Business
- Marek Pycia, University of California, Los Angeles
- Aaron Roth, University of Pennsylvania
- Al Roth, Stanford