Stable matching with couples

DOI10.1145/1963190.1970372zbMath1284.91416OpenAlexW2017943265WikidataQ130962567 ScholiaQ130962567MaRDI QIDQ5406236

Ildikó Schlotter, Robert W. Irving, Péter Biró

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1963190.1970372

zbMATH Keywords

heuristicsstable marriagematching schemes

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Matching models (91B68)

Related Items (14)

Modelling practical placement of trainee teachers to schools ⋮ Matching couples with Scarf's algorithm ⋮ Stable matchings of teachers to schools ⋮ Integer programming methods for special college admissions problems ⋮ Stability in Large Matching Markets with Complementarities ⋮ Hedonic diversity games: a complexity picture with more than two colors ⋮ Computing relaxations for the three-dimensional stable matching problem with cyclic preferences ⋮ ``Almost-stable matchings in the hospitals/residents problem with couples ⋮ Fractional solutions for capacitated NTU-games, with applications to stable matchings ⋮ Stable matchings with covering constraints: a complete computational trichotomy ⋮ Competitive equilibria in Shapley-Scarf markets with couples ⋮ A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences ⋮ MATCHING WITH COUPLES: A MULTIDISCIPLINARY SURVEY ⋮ Strategic Issues in One-to-One Matching with Externalities

This page was built for publication: Stable matching with couples