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

Adaptivity to changing environments and constraints is key to success in modern society. We
address this by proposing “incrementalized versions” of Stable Marriage and Stable …

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 work, we study truthful mechanisms for the rank-maximal matching problem, in the
view of approximation. Our result reduces the gap from both the upper and lower bound …

Given a bipartite graph, where the two sets of vertices are applicants and posts and ranks on
the edges represent preferences of applicants over posts, a rank-maximal matching is one in …

We focus on an online 2-stage problem, motivated by the following situation: consider a
system where students shall be assigned to universities. There is a first round where some …

In this work, we investigate truthful mechanisms for the rank-maximal matching problem from
an approximation standpoint. Our findings narrow the gap between the upper and lower …