Fair metric distortion for matching with preferences

Abstract: We consider the matching problem in the metric distortion framework. There are $n$ agents and $n$ items occupying points in a shared metric space, and the goal is to design a matching mechanism that outputs a low-cost matching between the agents and items, using only agents' ordinal rankings of the candidates by distance. A mechanism has distortion $\alpha$ if it always outputs a matching whose cost is within a factor of $\alpha$ of the optimum, in every instance regardless of the metric space. Typically, the cost of a matching is measured in terms of the total distance between matched agents and items, but this measure can incentivize unfair outcomes where a handful of agents bear the brunt of the cost. With this in mind, we consider how the metric distortion problem changes when the cost is instead measured in terms of the maximum cost of any agent. We show that while these two notions of distortion can in general differ by a factor of $n$, the distortion of a variant of the state-of-the-art mechanism, RepMatch, actually improves from $O(n<sup>2)$ under the sum objective to $O(n<sup>{1.58})$ under the max objective. We also show that for any fairness objective defined by a monotone symmetric norm, this algorithm guarantees distortion $O(n<sup>2)$.