Results 41 to 50 of about 18,935,794 (304)
Two-sided matching with one-sided preferences [PDF]
A stylized fact of most centralized matching markets (for example school choice problems is that participants tend to submit preference lists over a small number of potential matches. This paper is based on the premise that this fact provides additional information that can be used to match agents.
Guillaume Haeringer, Vincent Iehlé
openaire +3 more sources
Calpain small subunit homodimerization is robust and calcium‐independent
Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
Stable Two-Sided Satisfied Matching for Hospitals and Patients Based on the Disappointment Theory
With the global spread of COVID-19 and the shortage of medical resources, the key to improve the quality of medical services is to solve the problem of hospital–patient matching.
Xiaojia Wang +4 more
doaj +1 more source
Maintaining Stability for a Matching Problem Under Dynamic Preference
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
Design and analysis strategies for robust microbiome ageing research
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
Stability in one-sided matching markets [PDF]
The stable roommates problem may be unsolvable for sorne instances, therefore we study a relaxation, when it is allowed to form groups of any size (the stable partition problem). Two extensions of preferences over individuals to preferences over sets are
Cechlárová, Katarína +1 more
core +1 more source
Network Selection Algorithm Based on Stable Matching Game in Vehicular Heterogeneous Network
A gaming method of vehicular heterogeneous network selection was proposed, to solve the network access problem of vehicles in heterogeneous network coverage.
Rui Zhang, Jing Hu, Weiwei Xia
doaj +2 more sources
Some existing theories of triangular intuitionistic fuzzy numbers (TIFNs) and triangular intuitionistic fuzzy sets (TIFSs) are proved in this paper. In addition, this paper also provides some novel theorems and related proofs on TIFNs and TIFSs. Moreover,
Qi Yue +4 more
doaj +1 more source
Reconstructing enzyme evolution by protein engineering
Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler +2 more
wiley +1 more source
Decision Making Method of Personnel-position Matching Based on Improved Probabilistic Linguistic ORESTE [PDF]
With respect to the personnel-position matching in an information environment characterized by a multiattribute probabilistic linguistic set, a two-sided matching model is developed based on an improved ORESTE ranking method and matching aspiration.
WANG Lei, LI Wenjie, WANG Hai
doaj +1 more source

