Di¤erent solution concepts (core, stable sets, largest consistent set,...) can be de ned using either a direct or an indirect dominance relation. Direct dominance im-plies indirect dominance, but not the reverse. Hence, the predicted outcomes when assuming myopic (direct) or farsighted (indirect) agents could be very di¤erent. In this paper, we characterize absolutely stable roommate problems when preferences are strict. That is, we obtain the conditions on preference pro\u85les such that indirect dominance implies direct dominance in roommate problems. Furthermore, we char-acterize absolutely stable roommate problems having a non-empty core. Finally, we show that, if the core of an absolutely stable roommate problem is not empty, it contai...
The classic Stable Roommates problem (the non-bipartite generalization of the well-known Stable Marr...
We introduce a restriction of the stable roommates problem in which roommate pairs are ranked global...
We introduce a restriction of the stable roommates problem in which roommate pairs are ranked global...
Solution concepts in social environments use either a direct or indirect dom- inance relationship, d...
Abstract The aim of this paper is to propose a new solution concept for the roommate problem with st...
Solution concepts in social environments use either a direct or indirect dominance relationship, dep...
Solution concepts in social environments use either a direct or indirect dominance relationship, dep...
The stable roommates problem is a well-known problem of matching n people into n/2 disjoint pairs so...
In the multidimensional stable roommate problem, agents have to be allocated to rooms and have prefe...
The lack of stability in some matching problems suggests that alternative solution concepts to the c...
AbstractIn this paper, we describe an efficient algorithm that decides if a stable matching exists f...
AbstractIt is known that there may not exist any stable matching for a given instance of the stable ...
The aim of this paper is to propose a new solution for the roommate problem with strict preferences....
We compare different preference restrictions that ensure the existence of a stable roommate matching...
The Stable Roommates problem (SR) is characterized by the preferences of agents over other agents as...
The classic Stable Roommates problem (the non-bipartite generalization of the well-known Stable Marr...
We introduce a restriction of the stable roommates problem in which roommate pairs are ranked global...
We introduce a restriction of the stable roommates problem in which roommate pairs are ranked global...
Solution concepts in social environments use either a direct or indirect dom- inance relationship, d...
Abstract The aim of this paper is to propose a new solution concept for the roommate problem with st...
Solution concepts in social environments use either a direct or indirect dominance relationship, dep...
Solution concepts in social environments use either a direct or indirect dominance relationship, dep...
The stable roommates problem is a well-known problem of matching n people into n/2 disjoint pairs so...
In the multidimensional stable roommate problem, agents have to be allocated to rooms and have prefe...
The lack of stability in some matching problems suggests that alternative solution concepts to the c...
AbstractIn this paper, we describe an efficient algorithm that decides if a stable matching exists f...
AbstractIt is known that there may not exist any stable matching for a given instance of the stable ...
The aim of this paper is to propose a new solution for the roommate problem with strict preferences....
We compare different preference restrictions that ensure the existence of a stable roommate matching...
The Stable Roommates problem (SR) is characterized by the preferences of agents over other agents as...
The classic Stable Roommates problem (the non-bipartite generalization of the well-known Stable Marr...
We introduce a restriction of the stable roommates problem in which roommate pairs are ranked global...
We introduce a restriction of the stable roommates problem in which roommate pairs are ranked global...