In the multidimensional stable roommate problem, agents have to be allocated to rooms and
have preferences over sets of potential roommates. We study the complexity of finding good …

Purpose This study aims to develop a talent selection model for learning organizations
capable of connecting two groups, candidates in a talent hiring process and managers of the …

We study a two-sided matching problem under preferences, where the agents have
independent pairwise comparisons on their possible partners and these preferences may be …

The stable matching problem, which was introduced by Gale and Shapley [10], is one of the
most important mathematical models for real-world assignment problems. The National …

Purpose Textile manufacturers worldwide are reformulating their networks, often outsourcing
them to maintain a competitive advantage and increase market share. From this perspective …

We study housing markets as introduced by Shapley and Scarf. We investigate the
computational complexity of various questions regarding the situation of an agent a in a …

We provide a linear-time computable problem kernel of linear size for Strongly Stable
Roommates parameterized by the feedback edge number of the acceptability graph (which …

I study a two-sided marriage market in which agents have incomplete preferences--ie, they
find some alternatives incomparable. The strong (weak) core consists of matchings wherein …

In this paper, we consider the situation where each agent has a preference over a subset of
items and exactly one item is matched to each agent. The envy-freeness of a matching …

We study the 3D-Euclidean Multidimensional Stable Roommates problem, which asks
whether a given set $ V $ of $ s\cdot n $ agents with a location in 3-dimensional Euclidean …