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

DOI10.1016/J.ORL.2021.08.010MaRDI QIDQ2060385zbMATH OpenOpenAlexFDO

Authors 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

envy-freenessmatchingmatroid

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• The envy-free matching problem with pairwise preferences
• Envy-free matchings in bipartite graphs and their applications to fair division
• Envy-free matchings with lower quotas
• Envy-freeness in house allocation problems
• Pareto stable matchings under one-sided matroid constraints

Cites work

• A faster strongly polynomial time algorithm for submodular function minimization
• A Fixed-Point Approach to Stable Matchings and Some Applications
• A THEOREM ON INDEPENDENCE RELATIONS
• Algorithms and Computation
• Discrete Convex Analysis
• Envy-freeness in house allocation problems
• House markets with matroid and knapsack constraints
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• Improved Bounds for Matroid Partition and Intersection Algorithms
• Popular Matchings
• Popular matchings with ties and matroid constraints
• Reducibility among combinatorial problems
• Stable marriage and indifference
• The college admissions problem with lower and common quotas

Cited in

(6)

• On a conjecture by Gale about one-sided matching problems
• Almost envy-free repeated matching in two-sided markets
• scientific article; zbMATH DE number 7278072 (Why is no real title available?)
• Envy-free matchings in bipartite graphs and their applications to fair division
• Strongly stable matchings under matroid constraints
• Matroid and knapsack house allocation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2060385)