Results 21 to 30 of about 303,366 (308)
Multiple stable states in microbial communities explained by the stable marriage problem. [PDF]
ISME J, 2018 AbstractExperimental studies of microbial communities routinely reveal that they have multiple stable states. While each of these states is generally resilient, certain perturbations such as antibiotics, probiotics and diet shifts, result in transitions to other states.
Goyal A, Dubinkina V, Maslov S.
europepmc +5 more sources
Farsighted Collusion in Stable Marriage Problem [PDF]
, 2019 The Stable Marriage Problem, as proposed by Gale and Shapley, considers producing a bipartite matching between two equally sized sets of boys (proposers) and respectively girls (acceptors), each member having a total preference order over the other set, such that the outcome is stable. In this paper we consider the Game directly induced by this problem
Mircea Digulescu
openalex +3 more sources
Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences
Algorithms, 2013 The stable matching problem (also known as the stable marriage problem) is a well-known problem of matching men to women, so that no man and woman, who are not married to each other, both prefer each other.
Maria Silvia Pini +3 more
doaj +1 more source
Subjective Homophily and the Fixtures Problem
Games, 2020 The Stable Fixtures problem (Irving and Scott (2007)) is a generalized matching model that nests the well-known Stable Roommates, Stable Marriage, and College Admissions problems as special cases.
Joseph E. Duggan
doaj +1 more source
Weights in stable marriage problems increase manipulation opportunities [PDF]
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge, 2011 The stable marriage problem is a well-known problem of matching men to women so that no man and woman, who are not married to each other, both prefer each other. Such a 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.
PINI, MARIA SILVIA +3 more
openaire +3 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
Matching Transportation Ontologies with Word2Vec and Alignment Extraction Algorithm
Journal of Advanced Transportation, 2021 The development of intelligent transportation systems (ITSs) faces the challenge of integrating data from multiple unrelated sources. As one of the core technologies of knowledge integration in ITS, an ontology typically provides a normative definition ...
Xingsi Xue +5 more
doaj +1 more source
IEEE Access, 2021 Blind-spots, where wireless signals do not reach within the coverage range, often emerge in a dynamic environment due to obstacles, geographical location or mobility of cellular users (CUs).
Adeel Iqbal +9 more
doaj +1 more source
Asymmetry in Diagrams of Stable Marriage Problems: Stable Manifolds Mapped from Stable Matchings
Procedia Computer Science, 2014 AbstractIf the measure of computational complexity, defined as the computation time required to solve a problem, is independent from the computer used, the measure reflects the complexity of the algorithm and the problem instance. If the measure further does not depend on the algorithm, it purely reflects the complexity of the problem instance ...
Yoshiteru Ishida, Takumi Sato
openalex +2 more sources
Implementation of Stable Solutions to Marriage Problems [PDF]
Journal of Economic Theory, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
José Alcalde
openalex +2 more sources