Results 21 to 30 of about 12,042 (183)
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
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
Beauty and distance in the stable marriage problem [PDF]
Physica A: Statistical Mechanics and its Applications, 2001 The stable marriage problem has been introduced in order to describe a complex system where individuals attempt to optimise their own satisfaction, subject to mutually conflicting constraints. Due to the potential large applicability of such model to describe all the situation where different objects has to be matched pairwise, the statistical ...
Caldarelli G., Capocci A.
openaire +5 more sources
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
The Unsplittable Stable Marriage Problem [PDF]
, 2006 The Gale-Shapley “propose/reject” algorithm is a well-known procedure for solving the classical stable marriage problem. In this paper we study this algorithm in the context of the many-to-many stable marriage problem, also known as the stable allocation or ordinal transportation problem.
Brian C. Dean +2 more
openaire +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
Efficient algorithms for generalized Stable Marriage and Roommates problems [PDF]
, 2007 We consider a generalization of the Stable Roommates problem (SR), in which preference lists may be partially ordered and forbidden pairs may be present, denoted by SRPF.
Irving, R.W. +5 more
core +1 more source
An 8/5 approximation algorithm for a hard variant of stable marriage [PDF]
, 2007 When ties and incomplete preference lists are permitted in the Stable Marriage problem, stable matchings can have different sizes. The problem of finding a maximum cardinality stable matching in this context is NP-hard, even under very severe ...
Irving, R.W., Manlove, D.F.
core +1 more source
Stable marriage with ties and bounded length preference lists [PDF]
, 2009 We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practical applications, such as centralised matching schemes that assign ...
Irving, R.W. +5 more
core +1 more source
Size versus stability in the marriage problem [PDF]
, 2009 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.
Biró, Péter +8 more
core +1 more source