Weak Stable Matchings with Tenants and Ties

• Type: Article in International Conference Proceedings Book
• Date: 2006

Authors

Ana Paula Tomás (Author) FCUP

Conference proceedings International

Title: Proceedings o f the 11th Annual ERCIM Workshop on Constraint Solving and Constraint Programming

Pages: 255-264

11th Annual ERCIM Workshop on Constraint Solving and Constraint Programming (CSCLP 2006)

FCT/UNL, Lisbon, Portugal, 26 a 28 de Junho de 2006

Scientific classification

FOS: Natural sciences > Computer and information sciences

CORDIS: Physical sciences > Computer science

Other information

Abstract (EN): The paper addresses a variant of the stable marriage problem that models a job recruitment problem in which applicants are strictly ordered by priority but their preference lists may have ties. Some applicants may hold a post initially. These posts may be assigned to other applicants if their holders get another post. By reducing the problem to a sequence of maximal cardinality bipartite matching problems, combined with an effective propagation of the stability constraints, we show that applicant-optimal stable matchings may be found efficiently.

Language: English

Type (Professor's evaluation): Scientific

Notes: http://centria.di.fct.unl.pt/events/csclp06/csclp2006.pdf