Optimal cost-based allocations under two-sided preferences

DOI10.1007/978-3-031-34347-6_22MaRDI QIDQ6182910zbMATH OpenOpenAlexFDO

Authors 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

approximation algorithmscost-based allocationenvy-freenesslinear programmingmatchings under two-sided preferences

Mathematics Subject Classification ID

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

Cites work

• College Admissions and the Stability of Marriage
• Envy-free matchings with lower quotas
• Envy-freeness and relaxed stability: hardness and approximation algorithms
• scientific article; zbMATH DE number 1305096 (Why is no real title available?)
• Stable marriage with ties and bounded length preference lists
• The lattice of envy-free matchings

Cited in

(7)

• Two-sided allocation problems, decomposability, and the impossibility of efficient trade
• Equitable Cost Allocations via Primal–Dual-Type Algorithms
• Cost Allocation Revisited: An Optimality Result
• Optimal allocation with costly inspection and discrete types under ambiguity
• scientific article; zbMATH DE number 6938749 (Why is no real title available?)
• Optimal purchase of two-itemized drugs for a disease
• Generalized capacity planning for the hospital-residents problem

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

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