You are here

A CP-Based Approach for Popular Matching

Authors: 
Publication Type: 
Refereed Conference Meeting Proceeding
Abstract: 
We propose a constraint programming approach to the popular matching problem. We show that one can use the Global Cardinality Constraint to encode the problem even in cases that involve ties in the ordinal preferences of the applicants.
Conference Name: 
Thirtieth AAAI Conference on Artificial Intelligence
Proceedings: 
Proceedings of the Thirtieth {AAAI} Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA.
Digital Object Identifer (DOI): 
-
Publication Date: 
12/02/2016
Conference Location: 
United States of America
Institution: 
National University of Ireland, Cork (UCC)
Open access repository: 
No