Matchup 2022: matching and market design in Vienna, August 25-2

 Here's the announcement and call for papers

Matchup 2022 

MATCH-UP 2022 is the 6th workshop in an interdisciplinary and international workshop series on matching under preferences . It will take place on 25-26 August 2022, hosted by TU Vienna and co-located with MFCS 2022 (47th International Symposium on Mathematical Foundations of Computer Science).

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 College, University of London)
• Vijay Vazirani (University of California, Irvine)