1,435 research outputs found
An improved approximation lower bound for finding almost stable maximum matchings
In the stable marriage problem that allows incomplete preference lists, all stable matchings for a given instance have the same size. However, if we ignore the stability, there can be larger matchings. Biró et al. defined the problem of finding a maximum cardinality matching that contains minimum number of blocking pairs. They proved that this problem is not approximable within some constant δ>1unless P=NP, even when all preference lists are of length at most 3. In this paper, we improve this constant δ to n(1−ε) for any ε>0, where n is the number of men in an input
The Stable Roommates problem with short lists
We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists (sri) that are degree constrained, i.e., preference lists are of bounded length. The first variant, egald-sri, involves finding an egalitarian stable matching in solvable instances of sri with preference lists of length at most d. We show that this problem is NP-hard even if d = 3. On the positive side we give a 2d+372d+37-approximation algorithm for d ∈{3,4,5} which improves on the known bound of 2 for the unbounded preference list case. In the second variant of sri, called d-srti, preference lists can include ties and are of length at most d. We show that the problem of deciding whether an instance of d-srti admits a stable matching is NP-complete even if d = 3. We also consider the “most stable” version of this problem and prove a strong inapproximability bound for the d = 3 case. However for d = 2 we show that the latter problem can be solved in polynomial time
The Stable Roommates problem with short lists
We consider two variants of the classical Stable Roommates problem with
Incomplete (but strictly ordered) preference lists SRI that are degree
constrained, i.e., preference lists are of bounded length. The first variant,
EGAL d-SRI, involves finding an egalitarian stable matching in solvable
instances of SRI with preference lists of length at most d. We show that this
problem is NP-hard even if d=3. On the positive side we give a
(2d+3)/7-approximation algorithm for d={3,4,5} which improves on the known
bound of 2 for the unbounded preference list case. In the second variant of
SRI, called d-SRTI, preference lists can include ties and are of length at most
d. We show that the problem of deciding whether an instance of d-SRTI admits a
stable matching is NP-complete even if d=3. We also consider the "most stable"
version of this problem and prove a strong inapproximability bound for the d=3
case. However for d=2 we show that the latter problem can be solved in
polynomial time.Comment: short version appeared at SAGT 201
Finding large stable matchings
When ties and incomplete preference lists are permitted in the stable marriage and hospitals/residents problems, stable matchings can have different sizes. The problem of finding a maximum cardinality stable matching in this context is known to be NP-hard, even under very severe restrictions on the number, size, and position of ties. In this article, we present two new heuristics for finding large stable matchings in variants of these problems in which ties are on one side only. We describe an empirical study involving these heuristics and the best existing approximation algorithm for this problem. Our results indicate that all three of these algorithms perform significantly better than naive tie-breaking algorithms when applied to real-world and randomly-generated data sets and that one of the new heuristics fares slightly better than the other algorithms, in most cases. This study, and these particular problem variants, are motivated by important applications in large-scale centralized matching schemes
Robust randomized matchings
The following game is played on a weighted graph: Alice selects a matching
and Bob selects a number . Alice's payoff is the ratio of the weight of
the heaviest edges of to the maximum weight of a matching of size at
most . If guarantees a payoff of at least then it is called
-robust. In 2002, Hassin and Rubinstein gave an algorithm that returns
a -robust matching, which is best possible.
We show that Alice can improve her payoff to by playing a
randomized strategy. This result extends to a very general class of
independence systems that includes matroid intersection, b-matchings, and
strong 2-exchange systems. It also implies an improved approximation factor for
a stochastic optimization variant known as the maximum priority matching
problem and translates to an asymptotic robustness guarantee for deterministic
matchings, in which Bob can only select numbers larger than a given constant.
Moreover, we give a new LP-based proof of Hassin and Rubinstein's bound
Stable marriage and roommates problems with restricted edges: complexity and approximability
In the Stable Marriage and Roommates problems, a set of agents is given, each of them having a strictly ordered preference list over some or all of the other agents. A matching is a set of disjoint pairs of mutually acceptable agents. If any two agents mutually prefer each other to their partner, then they block the matching, otherwise, the matching is said to be stable. We investigate the complexity of finding a solution satisfying additional constraints on restricted pairs of agents. Restricted pairs can be either forced or forbidden. A stable solution must contain all of the forced pairs, while it must contain none of the forbidden pairs.
Dias et al. (2003) gave a polynomial-time algorithm to decide whether such a solution exists in the presence of restricted edges. If the answer is no, one might look for a solution close to optimal. Since optimality in this context means that the matching is stable and satisfies all constraints on restricted pairs, there are two ways of relaxing the constraints by permitting a solution to: (1) be blocked by as few as possible pairs, or (2) violate as few as possible constraints n restricted pairs.
Our main theorems prove that for the (bipartite) Stable Marriage problem, case (1) leads to View the MathML source-hardness and inapproximability results, whilst case (2) can be solved in polynomial time. For non-bipartite Stable Roommates instances, case (2) yields an View the MathML source-hard but (under some cardinality assumptions) 2-approximable problem. In the case of View the MathML source-hard problems, we also discuss polynomially solvable special cases, arising from restrictions on the lengths of the preference lists, or upper bounds on the numbers of restricted pairs
Size versus stability in the marriage problem
Given an instance I of the classical Stable Marriage problem with Incomplete preference lists (smi), a maximum cardinality matching can be larger than a stable matching. In many large-scale applications of smi, we seek to match as many agents as possible. This motivates the problem of finding a maximum cardinality matching in I that admits the smallest number of blocking pairs (so is “as stable as possible”). We show that this problem is NP-hard and not approximable within n1−ε, for any ε>0, unless P=NP, where n is the number of men in I. Further, even if all preference lists are of length at most 3, we show that the problem remains NP-hard and not approximable within δ, for some δ>1. By contrast, we give a polynomial-time algorithm for the case where the preference lists of one sex are of length at most 2. We also extend these results to the cases where (i) preference lists may include ties, and (ii) we seek to minimize the number of agents involved in a blocking pair
"Almost stable" matchings in the Roommates problem with bounded preference lists
An instance of the classical Stable Roommates problem need not admit a stable matching. Previous work has considered the problem of finding a matching that is "as stable as possible", i.e., admits the minimum number of blocking pairs. It is known that this problem is NP-hard and not approximable within n1 2-ε, for any ε>0, unless P=NP, where n is the number of agents in a given instance. In this paper, we extend the study to the Stable Roommates problem with Incomplete lists. In particular, we consider the case that the lengths of the lists are bounded by some integer d. We show that, even if d=3, there is some c>1 such that the problem of finding a matching with the minimum number of blocking pairs is not approximable within c unless P=NP. On the other hand, we show that the problem is solvable in polynomial time for d≤2, and we give a (2d-3)-approximation algorithm for fixed d<3. If the given lists satisfy an additional condition (namely the absence of a so-called elitist odd party-a structure that is unlikely to exist in general), the performance guarantee improves to 2d-4. © 2012 Elsevier B.V. All rights reserved
- …