In this work, we consider a student-project-resource matching-allocation problem, where
students have preferences over projects and the projects have preferences over students. In …

We consider many-to-one matching problems, where one side consists of students and the
other side of schools with capacity constraints. We study how to optimally increase the …

We consider an allocation problem of multiple types of objects to agents, where each type of
object has multiple copies (eg, multiple seats in a school), each agent is endowed with an …

The many-to-one stable matching problem provides the fundamental abstraction of several
real-world matching markets such as school choice and hospital-resident allocation. The …

We analyze how numerical experiments regarding elections were conducted within the
computational social choice literature (focusing on papers published in the IJCAI, AAAI, and …

Öğrenci-Proje Atama (ÖPA), genel olarak, çeşitli kriterlerin dikkate alınmasıyla öğrenci-proje
gruplarının oluşturmasını ve bu gruplara projelerin atanmasını içeren çok-kriterli bir problem …

Real-life applications of deferred-acceptance (DA) matching algorithms sometimes exhibit
errors or changes to the matching inputs that are discovered only after the algorithm has …

Multi-access edge computing (MEC) enables mobile units (MUs) to offload computation
tasks to edge servers nearby. This translates in energy savings for the MUs, but creates a …

We consider many-to-one matching problems, where one side corresponds to applicants
who have preferences and the other side to houses who do not have preferences. We …

Algorithmic decision making is used to make a wide variety of important decisions in today's
society, from bail decisions to school matchings. There is an increasing recognition of the …