Maximum Locally Stable Matchings
Motivated by the observation that most companies are more likely to consider job applicants referred by their employees than those who applied on their own, Arcaute and Vassilvitskii modeled a job market that integrates social networks into stable matchings in an interesting way. We call their model...
Main Authors: | Eric McDermid, Christine T. Cheng |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2013-06-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/6/3/383 |
Similar Items
-
Editorial: Special Issue on Matching under Preferences
by: Péter Biró, et al.
Published: (2014-04-01) -
Linear Time Local Approximation Algorithm for Maximum Stable Marriage
by: Zoltán Király
Published: (2013-08-01) -
A Note on the Uniqueness of Stable Marriage Matching
by: Drgas-Burchardt Ewa
Published: (2013-03-01) -
Matching-Updating Mechanism: A Solution for the Stable Marriage Problem with Dynamic Preferences
by: Akhmad Alimudin, et al.
Published: (2022-02-01) -
Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists
by: Shuichi Miyazaki, et al.
Published: (2013-05-01)