Socially fair matching: exact and approximation algorithms

DOI10.1007/978-3-031-38906-1_6MaRDI QIDQ6138991

Kirill Simonov, Fedor V. Fomin, Sayan Bandyapadhyay, Fahad Panolan, Unnamed Author

Publication date: 16 January 2024

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

zbMATH Keywords

fairnessmatchingapproximation algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Fair matchings and related problems
• The partitioning min-max weighted matching problem
• Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• Fair-by-design matching
• Procedurally fair and stable matching
• Fairness through awareness
• Reducibility among Combinatorial Problems
• Paths, Trees, and Flowers

This page was built for publication: Socially fair matching: exact and approximation algorithms