Description

The school will focus on Matching under Preferences. Matching problems with preferences are problems where we need to assign agents to resources, such as students to colleges, medical residents to hospitals, preschoolers to kindergartens, unemployed workers to jobs, students to hostels, donors to recipients, and so on. However, the agents have their own likes and dislikes over the possible assignments, and we want to find a matching that is “fair” and “efficient” according to these preferences

This school will introduce you to the fascinating world of matching problems with preferences from different perspectives, such as algorithms and complexity, discrete mathematics, and combinatorial optimization. You will learn about the main concepts, methods, and challenges in this field, and explore various types of problems and applications in this domain.

You do not need any prior knowledge of matching problems with preferences to attend this school. All you need is some basic knowledge of algorithms and mathematics, and a curiosity to learn more.

Eligibility

The school is intended for graduate students working or who want to work in the area of Computational Economics or Computational Social Choice Theory, and for motivated undergraduate students who are enthusiastic regarding these areas. People from the industry looking for exposure or those working or planning to work in this area will also find the school beneficial.

Speakers