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

DOI10.1016/j.orl.2021.08.010OpenAlexW3194479700MaRDI QIDQ2060385

Naoyuki Kamiyama

Publication date: 13 December 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2021.08.010

zbMATH Keywords

matchingmatroidenvy-freeness

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• The college admissions problem with lower and common quotas
• A faster strongly polynomial time algorithm for submodular function minimization
• Stable marriage and indifference
• Envy-freeness in house allocation problems
• Popular Matchings
• Improved Bounds for Matroid Partition and Intersection Algorithms
• Discrete Convex Analysis
• House Markets with Matroid and Knapsack Constraints
• Reducibility among Combinatorial Problems
• Popular Matchings with Ties and Matroid Constraints
• A Fixed-Point Approach to Stable Matchings and Some Applications
• Algorithms and Computation
• A THEOREM ON INDEPENDENCE RELATIONS

This page was built for publication: Envy-free matchings with one-sided preferences and matroid constraints