Hyperarc Consistency for the Many-to-Many Stable Matching Problem
Category : Paper Series EN
Issue No. 50 (Jun-Jul 2008)
Dr. Ioannis Mourtos, Dr. Dimitris Magos and Prof. Panagiotis Miliotis
The many-to-many Stable Matching problem (MM) is a generalization of the Stable Admissions (SA) and the Stable Marriage (SM) problem, both introduced by Gale and Shapley (1962). MM is usually defined in the context of a job market in which each firm wants to hire a set of workers and each worker can be employed in more than one firms, and vice versa.