Results 61 to 70 of about 2,510,319 (291)
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010 We introduce the {\sc classified stable matching} problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applicants. Both institutes and applicants have preferences over the other side.
openaire +5 more sources
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +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. +3 more
core +1 more source
Stable Matching with Interviews
CoRRIn several two-sided markets, including labor and dating, agents typically have limited information about their preferences prior to mutual interactions. This issue can result in matching frictions, as arising in the labor market for medical residencies, where high application rates are followed by a large number of interviews.
Itai Ashlagi +3 more
openaire +5 more sources
The human gut microbiome across the life course
FEBS Letters, EarlyView.Despite significant individual variation and continuous change throughout life, the human gut microbiome follows some life stage‐specific trends. This article provides a brief overview of how gut microbiome composition shifts across different phases of life. Created in BioRender. Özkurt, E. (2026) https://BioRender.com/8q4nrnc.
Alise J. Ponsero +4 more
wiley +1 more source
Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms
Journal of Computational Geometry, 2020 We study algorithms and combinatorial complexity bounds for stable-matching Voronoi diagrams, where a set, $S$, of $n$ point sites in the plane determines a stable matching between the points in $\mathbb{R}^2$ and the sites in $S$ such that (i) the ...
Gill Barequet +3 more
doaj +1 more source
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
Utility-Based Stable Matching For Large Scale EH Relay Networks With Finite-Alphabet Inputs
IEEE Access, 2019 The computational complexity of utility optimization for a large scale energy harvesting (EH) relay network is extremely high, especially when inputting finite-alphabet signals.
Feng Ke +5 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
`Sex-Equal' Stable Matchings [PDF]
Theory and Decision, 2001 This paper presents a solution concept that minimizes envy between groups 111 a bilateral matching market. This concept is designed to select stable matchings that are not men or women optimal. The idea is to compute the total number of women preferred by the men to their woman mates and the total number of men preferred by women to their mates in that
openaire +3 more sources