Envy-free matchings with one-sided preferences and matroid constraints

Research output: Contribution to journalArticlepeer-review


In this paper, we consider the problem of checking the existence of an envy-free matching in a many-to-one matching model with one-sided preferences and matroid constraints. For this problem, we propose a polynomial-time algorithm which is a generalization of the algorithm proposed by Gan, Suksompong, and Voudouris for the one-to-one setting. Furthermore, we consider a stronger variant of envy-freeness.

Original languageEnglish
Pages (from-to)790-794
Number of pages5
JournalOperations Research Letters
Issue number5
Publication statusPublished - Sept 2021

All Science Journal Classification (ASJC) codes

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics


Dive into the research topics of 'Envy-free matchings with one-sided preferences and matroid constraints'. Together they form a unique fingerprint.

Cite this