Motivated by the serious problem that hospitals in rural areas suffer from a shortage of
residents, we study the Hospitals/Residents model in which hospitals are associated with …

In this paper, we propose a new recommendation algorithm for addressing the problem of
two-sided online matching markets with complementary preferences and quota constraints …

Following up on purely theoretical work, we contribute further theoretical insights into
adapting stable two-sided matchings to change. Moreover, we perform extensive empirical …

We continue and extend previous work on the parameterized complexity analysis of the NP-
hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening …

Collective decision making problems capture situations where the preferences of agents
need to be aggregated into a compromise solution. This thesis focuses on two such …

In this paper, we study the Maximum Vertex-weighted b-Matching (MVbM) problem on
bipartite graphs in a new game-theoretical environment. In contrast to other game …

In the house allocation problem with lower and upper quotas, we are given a set of
applicants and a set of projects. Each applicant has a strictly ordered preference list over the …

Several real-world situations can be represented in terms of agents that have preferences
over activities in which they may participate. Often, the agents can take part in at most one …

We consider the problem of assigning agents to resources under the two-sided preference
list setting where resources specify an upper-quota and a lower-quota, that is, respectively …

Two-sided online matching is a crucial aspect of optimizing social welfare sequentially
within economic frameworks, achieved through pairing participants via third-party platforms …