Envy-free matchings with one-sided preferences and matroid constraints
type: Item
instance of: scholarly article
title: Envy-free matchings with one-sided preferences and matroid constraints
author: Naoyuki Kamiyama
published in: Operations Research Letters
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 90-XX
zbMATH DE Number: 7442929
zbMATH Keywords: matching
zbMATH Keywords: envy-freeness
zbMATH Keywords: matroid
MaRDI profile type: Publication
full work available at URL: j.orl.2021.08.010
OpenAlex ID: W3194479700
cites work: Algorithms and Computation
cites work: House Markets with Matroid and Knapsack Constraints
cites work: Popular Matchings
cites work: Popular Matchings with Ties and Matroid Constraints
cites work: Envy-freeness in house allocation problems
cites work: The college admissions problem with lower and common quotas
cites work: A Fixed-Point Approach to Stable Matchings and Some Applications
cites work: Stable marriage and indifference
cites work: Q5390304
cites work: Improved Bounds for Matroid Partition and Intersection Algorithms
cites work: A THEOREM ON INDEPENDENCE RELATIONS
cites work: Discrete Convex Analysis
cites work: A faster strongly polynomial time algorithm for submodular function minimization
cites work: Reducibility among Combinatorial Problems
DOI: 10.1016/J.ORL.2021.08.010
description: scientific article; zbMATH DE number 7442929