Results 21 to 30 of about 963,583 (273)
The exchange-stable marriage problem [PDF]
, 2005 In this paper we consider instances of stable matching problems, namely the classical stable marriage (SM) and stable roommates (SR) problems and their variants. In such instances we consider a stability criterion that has recently been proposed, that of
Abdulkadirogˇlu +16 more
core +2 more sources
A Note on the Uniqueness of Stable Marriage Matching
Discussiones Mathematicae Graph Theory, 2013 In this note we present some sufficient conditions for the uniqueness of a stable matching in the Gale-Shapley marriage classical model of even size. We also state the result on the existence of exactly two stable matchings in the marriage problem of odd
Drgas-Burchardt Ewa
doaj +1 more source
Faster and Simpler Approximation of Stable Matchings
Algorithms, 2014 We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m) time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(n3/2m) time, where n denotes the number of people andm ...
Katarzyna Paluch
doaj +1 more source
Multi-Attribute Crowdsourcing Task Assignment With Stability and Satisfactory
IEEE Access, 2019 Recently, crowdsourcing applications for smart cities have become more and more popular due to its higher work efficiency and lower work costs. However, the reasonable task assignment is still one of the important challenges for crowdsourcing.
Yuping Xing +3 more
doaj +1 more source
"Almost stable" matchings in the Roommates problem [PDF]
, 2006 An instance of the classical Stable Roommates problem (SR) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, i.e. admits the fewest number of blocking pairs. In this paper we prove that,
A.E. Roth +12 more
core +1 more source
Dynamically stable matching [PDF]
Theoretical Economics, 2019 I introduce a stability notion,dynamic stability, for two‐sided dynamic matching markets where (i) matching opportunities arrive over time, (ii) matching is one‐to‐one, and (iii) matching is irreversible. The definition addresses two conceptual issues. First, since not all agents are available to match at the same time, one must establish which agents ...
openaire +3 more sources
`Sex-Equal' Stable Matchings [PDF]
Theory and Decision, 2001 This paper presents a solution concept that minimizes envy between groups 111 a bilateral matching market. This concept is designed to select stable matchings that are not men or women optimal. The idea is to compute the total number of women preferred by the men to their woman mates and the total number of men preferred by women to their mates in that
openaire +3 more sources
An efficient implementation of the Gale and Shapley "propose-and-reject" algorithm
Electronic Journal of Graph Theory and Applications, 2020 We consider a version of the Hospitals/Residents problem which was first defined in 1962 by Gale and Shapley [9] under the name "College Admissions Problem". In particular, we consider the Firms/Candidates problem, where each Firm wishes to hire at least
Nasia Zacharia +2 more
doaj +1 more source
Saturating stable matchings [PDF]
Operations Research Letters, 2021 10 pages, 2 figures.
openaire +2 more sources
Local Search Approaches in Stable Matching Problems
Algorithms, 2013 The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or, more generally, to any two-sided market.
Toby Walsh +4 more
doaj +1 more source