Confirms that coordinate-wise median achieves tight approximation ratios of 2^{1-1/p} (p>=2) and sqrt(2) (1<=p<=2) and is optimal among deterministic anonymous strategyproof mechanisms; randomized mechanisms improve for p around 1.6 and above.
Strategyproof facility location and the least squares ob- jective
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GT 2years
2026 2representative citing papers
Authors initiate mechanism design for reconnecting disrupted regions by characterizing all strategyproof anonymous mechanisms and bounding their approximation ratios for social and maximum cost objectives.
citing papers explorer
-
Strategyproof Mechanisms for Euclidean Facility Location Problems under $L_p$-norm Social Cost
Confirms that coordinate-wise median achieves tight approximation ratios of 2^{1-1/p} (p>=2) and sqrt(2) (1<=p<=2) and is optimal among deterministic anonymous strategyproof mechanisms; randomized mechanisms improve for p around 1.6 and above.
-
Mechanism Design for Connecting Regions Under Disruptions
Authors initiate mechanism design for reconnecting disrupted regions by characterizing all strategyproof anonymous mechanisms and bounding their approximation ratios for social and maximum cost objectives.