Optimal Transport under Group Fairness Constraints
DGX agentarXiv:2601.07144v3 Announce Type: replace-cross Abstract: Ensuring fairness in matching algorithms is a key challenge in allocating scarce resources and positions. Focusing on Optimal Transport (OT),