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 study the problem of finding solutions to the stable matching problem that are robust to
errors in the input and we obtain a polynomial time algorithm for a special class of errors. In …

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 …

In a two-sided market with each agent ranking individuals on the other side according to
their preferences, such as location or incentive, the stable marriage problem calls to find a …

Abstract The Robust Stable Matching (RSM) problem involves finding a stable matching that
allows getting another stable matching within a minimum number of changes when a pair …

Being declarative, SQL stands a better chance at being the programming language for
conceptual computing next to natural language programming. We examine the possibility of …

Abstract The Robust Stable Marriage problem (RSM) is a variant of the classic Stable
Marriage problem in which the robustness of a given stable matching is measured by the …

Abstract Focusing on Stable Roommates (SR), we contribute to the toolbox for conducting
experiments for stable matching problems. We introduce the polynomial-time computable …

Focusing on Stable Roommates (SR) instances, we contribute to the toolbox for conducting
experiments for stable matching problems. We introduce a polynomial-time computable …

When computing stable matchings, it is usually assumed that the preferences of the agents
in the matching market are fixed. However, in many realistic scenarios, preferences change …