A matroid approach to stable matchings with lower quotas

Tamás Fleiner, Naoyuki Kamiyama

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

In 2010, 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 can hire in each class. Against the intuition that variations of the stable matching problem with lower quotas are difficult in general, Huang proved that lcsm can be solved in polynomial time. In this paper, we present a matroid-based approach to lcsm and we obtain the following results. (i) We solve a generalization of lcsm in which both sides have quotas. (ii) Huang raised a question about a polyhedral description of the set of stable assignments in lcsm. We give a positive answer for this question by exhibiting a polyhedral description of the set of stable assignments in a generalization of lcsm. (iii) We prove that the set of stable assignments in a generalization of lcsm has a lattice structure that is similar to the (ordinary) stable matching problem.

Original languageEnglish
Pages (from-to)734-744
Number of pages11
JournalMathematics of Operations Research
Volume41
Issue number2
DOIs
Publication statusPublished - May 2016

Fingerprint

Stable Matching
Matroid
Matching Problem
Assignment
Polynomials
Lattice Structure
Upper and Lower Bounds
Polynomial time
Matching problem
Stable matching
Residents
Generalization
Class

All Science Journal Classification (ASJC) codes

  • Mathematics(all)
  • Computer Science Applications
  • Management Science and Operations Research

Cite this

A matroid approach to stable matchings with lower quotas. / Fleiner, Tamás; Kamiyama, Naoyuki.

In: Mathematics of Operations Research, Vol. 41, No. 2, 05.2016, p. 734-744.

Research output: Contribution to journalArticle

@article{3d80f25985b640a696ad4ecceeb01d2d,
title = "A matroid approach to stable matchings with lower quotas",
abstract = "In 2010, 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 can hire in each class. Against the intuition that variations of the stable matching problem with lower quotas are difficult in general, Huang proved that lcsm can be solved in polynomial time. In this paper, we present a matroid-based approach to lcsm and we obtain the following results. (i) We solve a generalization of lcsm in which both sides have quotas. (ii) Huang raised a question about a polyhedral description of the set of stable assignments in lcsm. We give a positive answer for this question by exhibiting a polyhedral description of the set of stable assignments in a generalization of lcsm. (iii) We prove that the set of stable assignments in a generalization of lcsm has a lattice structure that is similar to the (ordinary) stable matching problem.",
author = "Tam{\'a}s Fleiner and Naoyuki Kamiyama",
year = "2016",
month = "5",
doi = "10.1287/moor.2015.0751",
language = "English",
volume = "41",
pages = "734--744",
journal = "Mathematics of Operations Research",
issn = "0364-765X",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "2",

}

TY - JOUR

T1 - A matroid approach to stable matchings with lower quotas

AU - Fleiner, Tamás

AU - Kamiyama, Naoyuki

PY - 2016/5

Y1 - 2016/5

N2 - In 2010, 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 can hire in each class. Against the intuition that variations of the stable matching problem with lower quotas are difficult in general, Huang proved that lcsm can be solved in polynomial time. In this paper, we present a matroid-based approach to lcsm and we obtain the following results. (i) We solve a generalization of lcsm in which both sides have quotas. (ii) Huang raised a question about a polyhedral description of the set of stable assignments in lcsm. We give a positive answer for this question by exhibiting a polyhedral description of the set of stable assignments in a generalization of lcsm. (iii) We prove that the set of stable assignments in a generalization of lcsm has a lattice structure that is similar to the (ordinary) stable matching problem.

AB - In 2010, 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 can hire in each class. Against the intuition that variations of the stable matching problem with lower quotas are difficult in general, Huang proved that lcsm can be solved in polynomial time. In this paper, we present a matroid-based approach to lcsm and we obtain the following results. (i) We solve a generalization of lcsm in which both sides have quotas. (ii) Huang raised a question about a polyhedral description of the set of stable assignments in lcsm. We give a positive answer for this question by exhibiting a polyhedral description of the set of stable assignments in a generalization of lcsm. (iii) We prove that the set of stable assignments in a generalization of lcsm has a lattice structure that is similar to the (ordinary) stable matching problem.

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

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

U2 - 10.1287/moor.2015.0751

DO - 10.1287/moor.2015.0751

M3 - Article

AN - SCOPUS:84963766582

VL - 41

SP - 734

EP - 744

JO - Mathematics of Operations Research

JF - Mathematics of Operations Research

SN - 0364-765X

IS - 2

ER -