Skip to main navigation Skip to search Skip to main content

A CP-based approach to popular matching

Research output: Chapter in Book/Report/Conference proceedingsConference proceedingpeer-review

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.

Original languageEnglish
Title of host publication30th AAAI Conference on Artificial Intelligence, AAAI 2016
PublisherAAAI Press
Pages4202-4203
Number of pages2
ISBN (Electronic)9781577357605
Publication statusPublished - 2016
Event30th AAAI Conference on Artificial Intelligence, AAAI 2016 - Phoenix, United States
Duration: 12 Feb 201617 Feb 2016

Publication series

Name30th AAAI Conference on Artificial Intelligence, AAAI 2016

Conference

Conference30th AAAI Conference on Artificial Intelligence, AAAI 2016
Country/TerritoryUnited States
CityPhoenix
Period12/02/1617/02/16

Fingerprint

Dive into the research topics of 'A CP-based approach to popular matching'. Together they form a unique fingerprint.

Cite this