Optimal cost-based allocations under two-sided preferences

DOI10.1007/978-3-031-34347-6_22OpenAlexW4379118124MaRDI QIDQ6182910

Girija Limaye, Meghana Nasre

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-34347-6_22

zbMATH Keywords

linear programmingapproximation algorithmsenvy-freenessmatchings under two-sided preferencescost-based allocation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Stable marriage with ties and bounded length preference lists
• The lattice of envy-free matchings
• Envy-free matchings with lower quotas
• College Admissions and the Stability of Marriage
• Envy-freeness and relaxed stability: hardness and approximation algorithms

This page was built for publication: Optimal cost-based allocations under two-sided preferences