The stable marriage problem is to find a matching between men and women, considering
preference lists in which each person expresses his/her preference over the members of the …

We consider instances of the Stable Roommates problem that arise from geometric
representation of participants' preferences: a participant is a point in a metric space, and his …

Since the early days of research in algorithms and complexity, the computation of stable
matchings is a core topic. While in the classic setting the goal is to match up two agents …

Abstract The Stable Roommates problem involves matching a set of agents into pairs based
on the agents' strict ordinal preference lists. The matching must be stable, meaning that no …

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 …

We investigate the Euclidean $ d $-Dimensional Stable Roommates problem, which asks
whether a given set~ $ V $ of $ d\cdot n $ points from the 2-dimensional Euclidean space …

Abstract In recent years, Transportation Network Companies (TNC) such as Uber and Lyft
have embraced ridesharing: a passenger who requests a ride may decide to save money in …

Purpose In recent decades, the student population in dormitories has increased notably,
primarily attributed to the growing number of international students. Dormitories serve as …

Given a classroom containing a fixed number of students and a fixed number of tables that
can be of different sizes, as well as a list of preferred classmates to sit with for each student …

We study the problem of fairly partitioning a set of agents into coalitions based on the agents'
additively separable preferences, which can also be viewed as a hedonic game. We study …