Results 21 to 30 of about 236,951 (263)
Characterization of Super-Stable Matchings [PDF]
, 2021 An instance of the super-stable matching problem with incomplete lists and ties is an undirected bipartite graph $G = (A \cup B, E)$, with an adjacency list being a linearly ordered list of ties. Ties are subsets of vertices equally good for a given vertex.
Changyong Hu, Vijay K. Garg
openaire +2 more sources
Understanding Popular Matchings via Stable Matchings [PDF]
SIAM Journal on Discrete Mathematics, 2022 Let $G = (A \cup B, E)$ be an instance of the stable marriage problem with strict preference lists. A matching $M$ is popular in $G$ if $M$ does not lose a head-to-head election against any matching where vertices are voters. Every stable matching is a min-size popular matching; another subclass of popular matchings that always exist and can be easily ...
Ágnes Cseh +3 more
openaire +5 more sources
Constrainedness in Stable Matching
2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), 2018 In constraint satisfaction problems, constrainedness provides a way to predict the number of solutions: for instances of a same size, the number of constraints is inversely correlated with the number of solutions. However, there is no obvious equivalent metric for stable matching problems.
Escamocher, Guillaume, O'Sullivan, Barry
openaire +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
On Stable Matchings and Flows [PDF]
Algorithms, 2010 We describe a flow model related to ordinary network flows the same way as stable matchings are related to maximum matchings in bipartite graphs. We prove that there always exists a stable flow and generalize the lattice structure of stable marriages to stable flows.
openaire +5 more sources
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
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
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
Maintaining Stability for a Matching Problem Under Dynamic Preference
IEEE Access, 2023 This study investigates two-sided matching and considers dynamic preference. In a stable matching problem, dynamic preference is a situation that often happens in real-world situations where the agent cannot express their preference with certainty.
Akhmad Alimudin +2 more
doaj +1 more source