On random exchange-stable matchings
From MaRDI portal
Publication:1642152
DOI10.1016/j.mathsocsci.2018.01.002zbMath1393.91126arXiv1707.01540OpenAlexW2963414285MaRDI QIDQ1642152
Publication date: 20 June 2018
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.01540
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The ``stable roommates problem with random preferences
- Hardness results on the man-exchange stable marriage problem with short preference lists
- Stable matching problems with exchange restrictions
- Automaton theory and modelling of biological systems. Translated by Scitran (Scientific Translation Service)
- On random exchange-stable matchings
- The exchange-stable marriage problem
- The Average Number of Stable Matchings
- On the Likely Number of Solutions for the Stable Marriage Problem
- Stable matchings and stable partitions∗
- On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm
- An upper bound for the solvability probability of a random stable roommates instance
- Random stable matchings
- Algorithmics of Matching Under Preferences
- An analysis of the stable marriage assignment algorithm
- Stable husbands
- College Admissions and the Stability of Marriage