In opportunistic mobile crowdsensing, participants (workers) accept to carry out the
requested sensing tasks only if they are already close to or within the regions of interest …

We propose two solution concepts for matchings under preferences: robustness and near
stability. The former strengthens while the latter relaxes the classical definition of stability by …

We investigate the so-called recoverable robust assignment problem on balanced bipartite
graphs with $2 n $ vertices, a mainstream problem in robust optimization: For two given …

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 two-stage committee elections where voters have dynamic preferences over
candidates; at each stage, a committee is chosen under a given voting rule. We are …

Abstract The classical Stable Roommates problem is to decide whether there exists a
matching of an even number of agents such that no two agents which are not matched to …

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 …

Target-based computer-assisted orchestration can be thought of as the process of searching
for combinations of orchestral sounds in a database of sound samples to match a given …

An instance I of the Stable Matching Problem (SMP) is given by a bipartite graph with a
preference list of neighbors for every vertex. A swap in I is the exchange of two consecutive …

This study investigates two-sided matching and considers dynamic preference. In a stable
matching problem, dynamic preference is a situation that often happens in real-world …