Many allocation and matching problems (e.g., student-school assignments, job allocation, organ donation) involve coupling agents based on mutual preferences. A central requirement in matching problems is that of stability, that is classically defined as follows: a matching is stable if no blocking pair exists, where a blocking pair is a pair of agents ...
Fanelli, Angelo, Moscardelli, Luca
openaire +2 more sources
Assigning Refugees to Landlords in Sweden: Efficient, Stable, and Maximum Matchings*
The member states of the European Union received 1.2 million first time asylum applications in 2015 (a doubling compared to 2014). Even if asylum will be granted for many of the refugees that made the journey to Europe, several obstacles for successful ...
Tommy Andersson, Lars Ehlers
semanticscholar +1 more source
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. [PDF]
Cseh Á, Escamocher G, Quesada L.
europepmc +1 more source
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. [PDF]
Mnich M, Schlotter I.
europepmc +1 more source
G-Aligner: a graph-based feature alignment method for untargeted LC-MS-based metabolomics. [PDF]
Wang R, Lu M, An S, Wang J, Yu C.
europepmc +1 more source
A practical revealed preference model for separating preferences and availability effects in marriage formation. [PDF]
Goyal S +4 more
europepmc +1 more source
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences. [PDF]
Cseh Á +3 more
europepmc +1 more source
"Almost-stable" matchings in the Hospitals / Residents problem with Couples. [PDF]
Manlove DF, McBride I, Trimble J.
europepmc +1 more source
Transformation from arbitrary matchings to stable matchings
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Applications of maximum matching by using bipolar fuzzy incidence graphs. [PDF]
Rehman FU, Rashid T, Hussain MT.
europepmc +1 more source

