Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship

TL;DR

This paper analyzes the performance of the Serial Dictatorship mechanism in truthful facility assignment problems under resource augmentation, providing exact bounds and showing improved ratios with increased capacity.

Contribution

It offers an exact linear programming analysis of Serial Dictatorship's worst-case performance with resource augmentation, deriving tight approximation bounds.

Findings

Serial Dictatorship's approximation ratio is g/(g-2) with capacity augmentation factor g ≥ 3.

Resource augmentation significantly improves the mechanism's approximation ratio.

As augmentation increases, the mechanism's performance approaches optimal.

Abstract

We study the truthful facility assignment problem, where a set of agents with private most-preferred points on a metric space are assigned to facilities that lie on the metric space, under capacity constraints on the facilities. The goal is to produce such an assignment that minimizes the social cost, i.e., the total distance between the most-preferred points of the agents and their corresponding facilities in the assignment, under the constraint of truthfulness, which ensures that agents do not misreport their most-preferred points. We propose a resource augmentation framework, where a truthful mechanism is evaluated by its worst-case performance on an instance with enhanced facility capacities against the optimal mechanism on the same instance with the original capacities. We study a very well-known mechanism, Serial Dictatorship, and provide an exact analysis of its performance. Although Serial Dictatorship is a purely combinatorial mechanism, our analysis uses linear programming; a linear program expresses its greedy nature as well as the structure of the input, and finds the input instance that enforces the mechanism have its worst-case performance. Bounding the objective of the linear program using duality arguments allows us to compute tight bounds on the approximation ratio. Among other results, we prove that Serial Dictatorship has approximation ratio $g/(g-2)$ when the capacities are multiplied by any integer $g \geq 3$. Our results suggest that even a limited augmentation of the resources can have wondrous effects on the performance of the mechanism and in particular, the approximation ratio goes to 1 as the augmentation factor becomes large. We complement our results with bounds on the approximation ratio of Random Serial Dictatorship, the randomized version of Serial Dictatorship, when there is no resource augmentation.