The envy-free matching problem with pairwise preferences

DOI10.1016/J.IPL.2021.106158zbMATH Open1476.91101OpenAlexW3173522007MaRDI QIDQ2234784FDOQ2234784

Authors: Naoyuki Kamiyama 

Publication date: 19 October 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106158

Recommendations

• On envy-free perfect matching
• Envy-freeness in house allocation problems
• Minimal envy and popular matchings
• Envy-freeness and relaxed stability: hardness and approximation algorithms
• Envy-free matchings with lower quotas

zbMATH Keywords

algorithmsmatchingenvy-freenesspairwise preference

Mathematics Subject Classification ID

Individual preferences (91B08) Matching models (91B68) Mathematical economics and fuzziness (91B86)

Cites Work

• Reducibility among combinatorial problems
• Parameterized algorithms
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• College Admissions and the Stability of Marriage
• Rank-maximal matchings
• Algorithms and Computation
• Title not available (Why is that?)
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Preference structures and their numerical representations
• Fair Allocation of Indivisible Goods
• Popular Matchings
• Stable marriage with general preferences
• Envy-freeness in house allocation problems
• The lattice of envy-free matchings
• Envy-free matchings with lower quotas

Cited In (6)

• Minimal envy and popular matchings
• Envy-free matchings in bipartite graphs and their applications to fair division
• Title not available (Why is that?)
• Envy-freeness and relaxed stability: hardness and approximation algorithms
• On envy-free perfect matching
• Repeatedly matching items to agents fairly and efficiently

This page was built for publication: The envy-free matching problem with pairwise preferences

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