A matroid approach to stable matchings with lower quotas

Tamás Fleiner, Naoyuki Kamiyama

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

12 被引用数 (Scopus)

抄録

In SODA'10, Huang introduced the laminar classified stable matching problem (LCSM for short) that is motivated by academic hiring. This problem is an extension of the well-known hospitals/residents problem in which a hospital has laminar classes of residents and it sets lower and upper bounds on the number of residents that it would hire in that class. Against the intuition that stable matching problems with lower quotas are difficult in general, Huang proved that this problem can be solved in polynomial time. In this paper, we propose a matroid-based approach to this problem and we obtain the following results, (i) We solve a generalization of the LCSM problem. (ii) We exhibit a polyhedral description for stable assignments of the LCSM problem, which gives a positive answer to Huang's question. (iii) We prove that the set of stable assignments of the LCSM problem has a lattice structure similarly to the ordinary stable matching model.

本文言語英語
ホスト出版物のタイトルProceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012
出版社Association for Computing Machinery
ページ135-142
ページ数8
ISBN(印刷版)9781611972108
DOI
出版ステータス出版済み - 2012
外部発表はい
イベント23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012 - Kyoto, 日本
継続期間: 1 17 20121 19 2012

出版物シリーズ

名前Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

その他

その他23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012
Country日本
CityKyoto
Period1/17/121/19/12

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)

フィンガープリント 「A matroid approach to stable matchings with lower quotas」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル