Fast Algorithms for Optimization Problems in Many-to-many Stable Matchings

  • -

Fast Algorithms for Optimization Problems in Many-to-many Stable Matchings

Category : Paper Series EN

Issue No. 54 (Feb-Mar 2009)

Pavlos Eirinakis, Dr. Ioannis Mourtos, Dr. Dimitris Magos and Prof. Panagiotis Miliotis

The Many-to-Many Stable Matching problem (MM) is a generalization of the Stable AdmissionsStable Marriage (SM) problem, both introduced by Gale and Shapley back in 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. Though many-to-one markets are easier to understand and seem to describe most labour markets, there are two reasons to study many-to-many markets. (SA) and the

Download

List of Working Paper Series