Fair-by-design matching
From MaRDI portal
Publication:2212506
DOI10.1007/s10618-020-00675-yzbMath1458.91144arXiv1802.02562OpenAlexW3004995474MaRDI QIDQ2212506
David García-Soriano, Francesco Bonchi
Publication date: 23 November 2020
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.02562
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pairwise kidney exchange
- Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
- Handbook of group decision and negotiation
- A short proof that matching matroids are transversal
- On implementing the push-relabel method for the maximum flow problem
- Understanding the generalized median stable matchings
- The Geometry of Fractional Stable Matchings and Its Applications
- Fairness through awareness
- Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs
- The Santa Claus problem
- The Price of Fairness
- Beyond the flow decomposition barrier
- TWO THEOREMS IN GRAPH THEORY
- Coverings of Bipartite Graphs
- An Algorithm for the Equipollent Resource Allocation Problem
- A new approach to the maximum-flow problem
- On the structure of all minimum cuts in a network and applications
- Optimal sharing
- A good algorithm for lexicographically optimal flows in multi-terminal networks
- The Sharing Problem
- A Fast Parametric Maximum Flow Algorithm and Applications
- Paths, Trees, and Flowers
- Random Matching Under Dichotomous Preferences
- Transversals and matroid partition
- Matroids and the greedy algorithm
- Cake cutting really is not a piece of cake
- College Admissions and the Stability of Marriage
- A new solution to the random assignment problem.
This page was built for publication: Fair-by-design matching
