Characterisation of Strongly Stable Matchings

DOI10.1137/1.9781611974331.ch8zbMath1410.05166arXiv1506.00677OpenAlexW2952834091MaRDI QIDQ4575583

Katarzyna E. Paluch, Pratik Ghosal, Adam Kunysz

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.00677

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Characterization of super-stable matchings ⋮ Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings ⋮ Dynamic rank-maximal and popular matchings ⋮ Core and stability notions in many-to-one matching markets with indifferences ⋮ Marriage market with indifferences: a linear programming approach ⋮ Unnamed Item ⋮ Pairwise Preferences in the Stable Marriage Problem

This page was built for publication: Characterisation of Strongly Stable Matchings