DOIAbstract
AbstractFor the stable roommates problem recently a new concept, exchange stability, was introduced. In this paper we prove that it is NP-complete to decide whether for a given preference profile an exchange stable matching exists
AbstractFor the stable roommates problem recently a new concept, exchange stability, was introduced. In this paper we prove that it is NP-complete to decide whether for a given preference profile an exchange stable matching exists
The stable marriage problem is that of matching n men and n women, each of whom has ranked the membe...
In this paper, we describe an efficient algorithm that decides if a stable matching exists for a gen...
We compare different preference restrictions that ensure the existence of a stable roommate matching...
AbstractFor the stable roommates problem recently a new concept, exchange stability, was introduced....
In this paper we consider instances of stable matching problems, namely the classical stable marriag...
AbstractIt is known that there may not exist any stable matching for a given instance of the stable ...
AbstractIn this paper, we describe an efficient algorithm that decides if a stable matching exists f...
In the multidimensional stable roommate problem, agents have to be allocated to rooms and have prefe...
The stable roommates problem is a well-known problem of matching n people into n/2 disjoint pairs so...
The classic Stable Roommates problem (the non-bipartite generalization of the well-known Stable Marr...
We study variants of classical stable matching problems in which there is an additional requirement ...
We introduce a restriction of the stable roommates problem in which roommate pairs are ranked global...
The stable roommates problem may be unsolvable for sorne instances, therefore we study a relaxation,...
We introduce a restriction of the stable roommates problem in which roommate pairs are ranked global...
When computing stable matchings, it is usually assumed that the preferences of the agents in the mat...
The stable marriage problem is that of matching n men and n women, each of whom has ranked the membe...
In this paper, we describe an efficient algorithm that decides if a stable matching exists for a gen...
We compare different preference restrictions that ensure the existence of a stable roommate matching...
AbstractFor the stable roommates problem recently a new concept, exchange stability, was introduced....
In this paper we consider instances of stable matching problems, namely the classical stable marriag...
AbstractIt is known that there may not exist any stable matching for a given instance of the stable ...
AbstractIn this paper, we describe an efficient algorithm that decides if a stable matching exists f...
In the multidimensional stable roommate problem, agents have to be allocated to rooms and have prefe...
The stable roommates problem is a well-known problem of matching n people into n/2 disjoint pairs so...
The classic Stable Roommates problem (the non-bipartite generalization of the well-known Stable Marr...
We study variants of classical stable matching problems in which there is an additional requirement ...
We introduce a restriction of the stable roommates problem in which roommate pairs are ranked global...
The stable roommates problem may be unsolvable for sorne instances, therefore we study a relaxation,...
We introduce a restriction of the stable roommates problem in which roommate pairs are ranked global...
When computing stable matchings, it is usually assumed that the preferences of the agents in the mat...
The stable marriage problem is that of matching n men and n women, each of whom has ranked the membe...
In this paper, we describe an efficient algorithm that decides if a stable matching exists for a gen...
We compare different preference restrictions that ensure the existence of a stable roommate matching...
Add to ORKG