MATCH-UP 2019, the 5th International Workshop on Matching Under Preferences, will be held in the Congressi Stefano Franscini, Monte Verità, Ascona, Switzerland from Sunday 26 May – Wednesday 29 May 2019. It is the fifth in the series of interdisciplinary and international workshops 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.
Submit your paper
We call for original papers that have not previously been published in (or accepted to appear in) a conference proceedings or a journal. Papers can however be under review for a conference or journal elsewhere at the time of submission.
There is no page limit for submissions. The submission should contain within the first 12 pages a clear presentation of the merits of the paper, including a discussion of the paper's importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. Proofs that can enable the main mathematical claims of the paper to be verified must be provided. Material other than the first 12 pages will be read at the committee's discretion.
Only abstracts of accepted papers will appear in the workshop proceedings. This should allow the simultaneous or subsequent submission of contributed papers to other workshops, conferences or journals. If authors so choose, they may include a link to the full version of their paper (if published, e.g., on arXiv, REpeC, SSRN or on a personal web page) in the proceedings.
The submissions server is not yet open.
Best Paper AwardAlgorithms is sponsoring a Best Paper Award for the conference. The award will consist of 500 Swiss Francs. The journal is also inviting extended conference papers of MATCH-UP 2019. For more information, see the announcement.
Best Paper/Poster Presentation AwardThe Director and Scientific Board of the Congressi Stefano Franscini have established a CSF Award for young scientists. This will be awarded to the participant that gives the best paper presentation (content and form) or poster presentation at the conference. To be eligible for this award, you must be a PhD student or someone who has accomplished a PhD within the last 3 years, with a maximum age of 33 years. The award will consist of 500 CHF, together with a certicficate and a CSF memento.
Important dates (provisional)
- Paper submission deadline: 15 January 2019
- Notification: 22 February 2019
- Final version for proceedings: 15 March 2019
- Poster abstract submission deadline: 1 April 2019
- Workshop: Sunday 26 May (starting at 1400) to Wednesday 29 May (ending at 1830) with an excursion in the afternoon of Tuesday 28 May
Péter Biró graduated as a matematician from the Budapest University of Technology and Economics (2003) and received his PhD in mathematics and computer science from the same institute (2007). In the meantime he studied economics at the Corvinus University of Budapest, where he specialised in EU studies (2007). His research interest lies in the fields of cooperative game theory, algorithmic mechanism design and matching theory in particular. Before joining the game theory research group of the Institute of Economics in October 2010 he worked as a postdoc researcher at the University of Glasgow for three and a half years. He was a visiting professor at the Economics Department in Stanford University for a year in 2014, invited be Al Roth. In July 2016 he started a research group on Market Design, sponsored by the Momentum Grant of the Academy. Besides the theoretical research, he has been involved in several applications, such as the UK kidney exchange program, the Scottish resident allocation scheme and the Hungarian higher education matching scheme.
Flip Klijn received his Ph.D. in Economics from Tilburg University in 2000. Currently, he is senior scientific researcher at the Institute for Economic Analysis (IAE-CSIC) in Barcelona, Spain. His research interests include matching theory, market design, game theory, operations research, and social choice theory. He has published around 50 articles in a broad range of journals, including American Economic Review, Journal of Economic Theory, Experimental Economics, Games and Economic Behavior, and Journal of Mathematical Economics.
Ildi Schlotter is an associate professor at the Budapest University of Technology and Economics. She wrote her PhD thesis under the supervision of Dániel Marx on the parameterized complexity of certain graph modification and stable matching problems. She has taught algorithm theory, computer science, and formal languages to BSc and MSc students. Her research focuses on parameterized algorithm theory and its application in the area of computational social choice, with an emphasis on stable matchings and the allocation of indivisible goods. She is a co-author of an introductory chapter on parameterized complexity in the recent book Trends in Computational Social Choice edited by Ulle Endriss.
Bahar Rastegari is a lecturer (assistant professor) at the School of Electronics and Computer Science, University of Southampton, UK. She received her Ph.D. in 2013 from the University of British Columbia (UBC), Canada, under the supervision of Anne Condon and Kevin Leyton-Brown. She then worked as a postdoctoral researcher with David Manlove at the University of Glasgow for three years. She was a lecturer at the Department of Computer Science, University of Bristol, for a year and a half before taking up her recent post at the University of Southampton. Bahar’s research interests include computational social choice and algorithmic mechanism design with particular focus on matching theory.
- Bettina Klaus, University of Lausanne, Switzerland (Chair)
- Péter Biró, Hungarian Academy of Sciences, Hungary
- David Manlove, University of Glasgow, UK
- Marek Pycia, University of California, Los Angeles, USA, and University of Zürich, Switzerland
MATCH-UP 2012: 19-20 July 2012 at Corvinus University of Budapest, Hungary (68 participants).
MATCH-UP 2015: 14-16 April 2015 at the University of Glasgow, Scotland (80 participants).
MATCH-UP 2017: 20-21 April 2017 at Microsoft Research New England, Cambridge, USA (108 participants).