A CP-Based Approach for Popular Matching

Danuta Sorina Chisca, Mohamed Siala, Gilles Simonin, Barry O'Sullivan

AAAI 2016 pp. 4202-4203

doi:10.1609/AAAI.V30I1.9944 /aaai/2016/chisca2016aaai-cp/

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.

PDF AAAI Semantic Scholar

Cite

Text

Chisca et al. "A CP-Based Approach for Popular Matching." AAAI Conference on Artificial Intelligence, 2016. doi:10.1609/AAAI.V30I1.9944

Markdown

[Chisca et al. "A CP-Based Approach for Popular Matching." AAAI Conference on Artificial Intelligence, 2016.](https://mlanthology.org/aaai/2016/chisca2016aaai-cp/) doi:10.1609/AAAI.V30I1.9944

BibTeX

@inproceedings{chisca2016aaai-cp,
  title     = {{A CP-Based Approach for Popular Matching}},
  author    = {Chisca, Danuta Sorina and Siala, Mohamed and Simonin, Gilles and O'Sullivan, Barry},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2016},
  pages     = {4202-4203},
  doi       = {10.1609/AAAI.V30I1.9944},
  url       = {https://mlanthology.org/aaai/2016/chisca2016aaai-cp/}
}