6th International Workshop on Matching under Preferences
Web page: https://ac.tuwien.ac.at/matchup2022
MATCH-UP 2022 will be held at TU Vienna, Austria, on 25-26 August 2022. It will be co-located with MFCS 2022 (47th International Symposium on Mathematical Foundations of Computer Science).
Background
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 preferences 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. There has been a resurgence of activity in this area in recent years, with online and mobile computing opening up new avenues of research and novel, path-breaking applications.
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. Thus, a key objective is to bring together the research communities of the related areas. Another important aim is to convey the excitement of recent research and new application areas, exposing participants to new ideas, new techniques, and new problems.
List of Topics
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, and school choice)
* 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, coalition formation games, and kidney exchange)
* Multi-dimensional matchings (e.g., 3D stable matching problems)
* Matching with payments (e.g., assignment game)
* Online and stochastic matching models (e.g., Google Ads, ride sharing, Match.com)
* Other recent applications (e.g., refugee resettlement, food banks, social housing, and daycare)
Invited Speakers
* Sophie Bade (Royal Holloway, University of London)
* Vijay Vazirani (University of California, Irvine)
Paper Submissions
We call for two types of contributions. Authors should indicate which format type their paper should be considered under.
Format A
* Original contribution, not previously published in (or accepted by) another conference proceedings or journal
* Not under review for a conference or journal elsewhere
Format B
* Not necessarily original work
* Can have been published already in (or accepted by) another conference proceedings or journal
* Can be under review for a conference or journal elsewhere
The Programme Committee may give priority to Format A papers in the final selection.
Submissions should be at most 12 pages long (excluding bibliography), formatted for A4 paper, using 11 point font or larger with at least 1" margins all round, and in single-column format. Any material beyond this limit should be placed in a clearly marked appendix which will be read at the discretion of the programme committee. There is no specified style file for submissions.
Proceedings
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.
Important Dates
Paper submission deadline: 22 April 2022
Author notification: 9 June 2022
Early registration deadline: 30 June 2022
Workshop: 25-26 August 2022
Organising Committee
Jiehua Chen (TU Vienna, Austria)
David Manlove (University of Glasgow, UK)
Alex Teytelboym (University of Oxford, UK)
Contact
matchup2022@ac.tuwien.ac.at
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
