We study deterministic strategyproof aggregation in finite-dimensional Euclidean spaces. For every odd number $n\ge3$ of agents and every finite dimension, we prove that the coordinate-wise median minimizes the worst-case approximation ratio for total Euclidean distance among all continuous, anonymous, deterministic strategyproof mechanisms. The same optimality result holds for every even $n\ge4$ when each coordinate uses a fixed choice of the lower or upper middle rank. The proof combines a rigidity theorem with a normalization that does not increase the approximation ratio: any hypothetical mechanism outperforming the median has a normalized representative that is a fixed coordinate-wise order-statistic rule in a single orthonormal frame. A reflection argument then shows that no such rule improves on the median.

翻译：暂无翻译