Stable matchings with ties, master preference lists, and matroid constraints

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

In this paper, we consider a matroid generalization of the hospitals/residents problem with ties and master lists. In this model, the capacity constraints for hospitals are generalized to matroid constraints. By generalizing the algorithms of O’Malley for the hospitals/residents problem with ties and master lists, we give polynomial-time algorithms for deciding whether there exist a super-stable matching and a strongly stable matching in our model, and finding such matchings if they exist.

Original languageEnglish
Title of host publicationAlgorithmic Game Theory - 8th International Symposium, SAGT 2015
EditorsMartin Hoefer, Martin Hoefer
PublisherSpringer Verlag
Pages3-14
Number of pages12
ISBN (Print)9783662484326
DOIs
Publication statusPublished - Jan 1 2015
Event8th International Symposium on Algorithmic Game Theory, SAGT 2015 - Saarbrucken, Germany
Duration: Sep 28 2015Sep 30 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9347
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th International Symposium on Algorithmic Game Theory, SAGT 2015
CountryGermany
CitySaarbrucken
Period9/28/159/30/15

Fingerprint

Stable Matching
Tie
Matroid
Capacity Constraints
Polynomial-time Algorithm
Polynomials
Model

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kamiyama, N. (2015). Stable matchings with ties, master preference lists, and matroid constraints. In M. Hoefer, & M. Hoefer (Eds.), Algorithmic Game Theory - 8th International Symposium, SAGT 2015 (pp. 3-14). [A1] (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9347). Springer Verlag. https://doi.org/10.1007/978-3-662-48433-3_1

Stable matchings with ties, master preference lists, and matroid constraints. / Kamiyama, Naoyuki.

Algorithmic Game Theory - 8th International Symposium, SAGT 2015. ed. / Martin Hoefer; Martin Hoefer. Springer Verlag, 2015. p. 3-14 A1 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9347).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kamiyama, N 2015, Stable matchings with ties, master preference lists, and matroid constraints. in M Hoefer & M Hoefer (eds), Algorithmic Game Theory - 8th International Symposium, SAGT 2015., A1, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9347, Springer Verlag, pp. 3-14, 8th International Symposium on Algorithmic Game Theory, SAGT 2015, Saarbrucken, Germany, 9/28/15. https://doi.org/10.1007/978-3-662-48433-3_1
Kamiyama N. Stable matchings with ties, master preference lists, and matroid constraints. In Hoefer M, Hoefer M, editors, Algorithmic Game Theory - 8th International Symposium, SAGT 2015. Springer Verlag. 2015. p. 3-14. A1. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-662-48433-3_1
Kamiyama, Naoyuki. / Stable matchings with ties, master preference lists, and matroid constraints. Algorithmic Game Theory - 8th International Symposium, SAGT 2015. editor / Martin Hoefer ; Martin Hoefer. Springer Verlag, 2015. pp. 3-14 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{f12fa3522e9a44ad81ab8711c528a9e3,
title = "Stable matchings with ties, master preference lists, and matroid constraints",
abstract = "In this paper, we consider a matroid generalization of the hospitals/residents problem with ties and master lists. In this model, the capacity constraints for hospitals are generalized to matroid constraints. By generalizing the algorithms of O’Malley for the hospitals/residents problem with ties and master lists, we give polynomial-time algorithms for deciding whether there exist a super-stable matching and a strongly stable matching in our model, and finding such matchings if they exist.",
author = "Naoyuki Kamiyama",
year = "2015",
month = "1",
day = "1",
doi = "10.1007/978-3-662-48433-3_1",
language = "English",
isbn = "9783662484326",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "3--14",
editor = "Martin Hoefer and Martin Hoefer",
booktitle = "Algorithmic Game Theory - 8th International Symposium, SAGT 2015",
address = "Germany",

}

TY - GEN

T1 - Stable matchings with ties, master preference lists, and matroid constraints

AU - Kamiyama, Naoyuki

PY - 2015/1/1

Y1 - 2015/1/1

N2 - In this paper, we consider a matroid generalization of the hospitals/residents problem with ties and master lists. In this model, the capacity constraints for hospitals are generalized to matroid constraints. By generalizing the algorithms of O’Malley for the hospitals/residents problem with ties and master lists, we give polynomial-time algorithms for deciding whether there exist a super-stable matching and a strongly stable matching in our model, and finding such matchings if they exist.

AB - In this paper, we consider a matroid generalization of the hospitals/residents problem with ties and master lists. In this model, the capacity constraints for hospitals are generalized to matroid constraints. By generalizing the algorithms of O’Malley for the hospitals/residents problem with ties and master lists, we give polynomial-time algorithms for deciding whether there exist a super-stable matching and a strongly stable matching in our model, and finding such matchings if they exist.

UR - http://www.scopus.com/inward/record.url?scp=84983788976&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84983788976&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-48433-3_1

DO - 10.1007/978-3-662-48433-3_1

M3 - Conference contribution

AN - SCOPUS:84983788976

SN - 9783662484326

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 3

EP - 14

BT - Algorithmic Game Theory - 8th International Symposium, SAGT 2015

A2 - Hoefer, Martin

A2 - Hoefer, Martin

PB - Springer Verlag

ER -