Results 11 to 20 of about 2,510,319 (291)
A constraint programming approach to the stable marriage problem [PDF]
, 2001 The Stable Marriage problem (SM) is an extensively-studied combinatorial problem with many practical applications. In this paper we present two encodings of an instance I of SM as an instance J of a Constraint Satisfaction Problem.
Gent, Ian Philip +15 more
core +9 more sources
Frontiers in Environmental Science, 2022 As an important path of industrial structure adjustment and upgrading, industrial transfer is of great significance to narrow the regional economic development gap in China and promoting the sustainable development of regional economies.
Lifan Shi +4 more
doaj +1 more source
Jointly stable matchings [PDF]
Journal of Combinatorial Optimization, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shuichi Miyazaki, Kazuya Okamoto
openaire +7 more sources
Spectrum Allocation Scheme Based on Stable Matching in Hierarchical Cognitive Satellite Network
IEEE Access, 2022 Aiming at the problem that the number of users and available bandwidth of the current satellite service are increasing significantly, and the spectrum utilization rate of the existing spectrum allocation scheme is low, this paper first establishes a ...
Zhiguo Liu, Wenqiang Lv, Xiaobo Ren
doaj +1 more source
Stable Matching Relay Selection (SMRS) for TWR D2D Network With RF/RE EH Capabilities
IEEE Access, 2022 The green Internet of Things (IoT) has emerged as a promising paradigm to reduce the energy consumed by nodes in dense networks. To ensure energy efficiency (EE) operation, network devices are equipped with energy harvesting (EH) batteries that can ...
Omnia M. El-Nakhla +2 more
doaj +1 more source
Stability and Median Rationalizability for Aggregate Matchings
Games, 2021 We develop the theory of stability for aggregate matchings used in empirical studies and establish fundamental properties of stable matchings including the result that the set of stable matchings is a non-empty, complete, and distributive lattice ...
Federico Echenique +3 more
doaj +1 more source
Essentially stable matchings [PDF]
Games and Economic Behavior, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter Troyan +2 more
openaire +1 more source
Saturating stable matchings [PDF]
Operations Research Letters, 2021 10 pages, 2 figures.
openaire +2 more sources
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 +3 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 +6 more sources