Results 1  10
of
3,031
NearPopular Matchings in the Roommates Problem
 In Proceedings of the 19th Annual European Symposium on Algorithms
, 2011
"... Abstract. Our input is a graph G = (V,E) where each vertex ranks its neighbors in a strict order of preference. The problem is to compute a matching in G that captures the preferences of the vertices in a popular way. Matching M is more popular than matching M ′ if the number of vertices that prefer ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. Our input is a graph G = (V,E) where each vertex ranks its neighbors in a strict order of preference. The problem is to compute a matching in G that captures the preferences of the vertices in a popular way. Matching M is more popular than matching M ′ if the number of vertices
Popular matchings in the stable marriage problem
 In Proceedings of the 38th International Colloquium on Automata, Languages and Programming
, 2011
"... Abstract. The input is a bipartite graph G = (A ∪B,E) where each vertex u ∈ A ∪B ranks its neighbors in a strict order of preference. This is the same as an instance of the stable marriage problem with incomplete lists. A matching M ∗ is said to be popular if there is no matching M such that more ve ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. The input is a bipartite graph G = (A ∪B,E) where each vertex u ∈ A ∪B ranks its neighbors in a strict order of preference. This is the same as an instance of the stable marriage problem with incomplete lists. A matching M ∗ is said to be popular if there is no matching M such that more
Bistable versions of the marriages and roommates problems
 Journal of Computer and System Sciences
, 1999
"... A stable matching for an instance of the stable marriages problem or the stable roommates problem is bistable if it is also a stable matching when the ordering of the input preference lists is reversed. For the stable marriages problem, it is shown that the bistable matchings are a sublattice of the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A stable matching for an instance of the stable marriages problem or the stable roommates problem is bistable if it is also a stable matching when the ordering of the input preference lists is reversed. For the stable marriages problem, it is shown that the bistable matchings are a sublattice
Credible Stability in the Roommate Problem
, 2009
"... Preliminary and incomplete. In the roommate problem, it is known that a stable matching may not exist. In this paper, we propose a new deviationproof concept, called credible stability, and show that the concept resolves the problem. At a credibly stable matching, any coalition which deviates from ..."
Abstract
 Add to MetaCart
in the roommate problem. Moreover, we show that in some cases the credible stability concept assigns an agent who is single at any stable matchings to another agent in the marriage problem. That is, the credible stability overcomes the wellknown rural hospital theorem which is one of the most serious drawbacks
THE ROOMMATES PROBLEM REVISITED
, 2007
"... Abstract. One of the oldest but least understood matching problems is Gale and Shapley’s (1962) “roommates problem”: is there a stable way to assign 2N students into N roommate pairs? Unlike the classic marriage problem or college admissions problem, there need not exist a stable solution to the roo ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. One of the oldest but least understood matching problems is Gale and Shapley’s (1962) “roommates problem”: is there a stable way to assign 2N students into N roommate pairs? Unlike the classic marriage problem or college admissions problem, there need not exist a stable solution
THE ROOMMATES PROBLEM DISCUSSED
"... Abstract. The stable roommates problem as originally posed by Gale and Shapley [1] in 1962 involves a single set of even cardinality 2n, each member of which ranks every other member in order of preference. A stable matching is then a partition of this single set into n pairs such that no two unmatc ..."
Abstract
 Add to MetaCart
Abstract. The stable roommates problem as originally posed by Gale and Shapley [1] in 1962 involves a single set of even cardinality 2n, each member of which ranks every other member in order of preference. A stable matching is then a partition of this single set into n pairs such that no two
The stable roommates problem with globallyranked pairs
 IN PROC. OF THE 3RD INT. WORKSHOP ON INTERNET AND NETWORK ECONOMICS (WINE
, 2007
"... We introduce a restriction of the stable roommates problem in which roommate pairs are ranked globally. In contrast to the unrestricted problem, weakly stable matchings are guaranteed to exist, and additionally, can be found in polynomial time. However, it is still the case that strongly stable matc ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
We introduce a restriction of the stable roommates problem in which roommate pairs are ranked globally. In contrast to the unrestricted problem, weakly stable matchings are guaranteed to exist, and additionally, can be found in polynomial time. However, it is still the case that strongly stable
The stable roommates problem and chess tournament pairings
 Divulgaciones Matemáticas
, 1999
"... In many chess tournaments the number of players is much larger than the number of rounds to be played. In such tournaments the Swiss pairing system is usually used. This means that players with equal or almost equal scores so far are played against each other. Moreover, each player should alternatel ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
: stable roommates problem, Swiss pairing system, stable marriage problem, chess. Resumen En muchos torneos de ajedrez el número de jugadores es mucho mayor que el número de rondas a jugarse. En tales torneos es usado usualmente el sistema Suizo de pareo. Esto significa que los jugadores con puntuación
Results 1  10
of
3,031