Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)

Prove the conjectured 5/2 social-cost bound for Mixed-Percentile on the line

Prove that the Mixed-Percentile mechanism achieves an approximation ratio of at most 5/2 for the social cost in the two-facility location problem with candidate locations on the line.

Background

The paper establishes that universally strategyproof mechanisms for the social cost on line metrics have an optimal approximation ratio between 5/2 and 3. It provides a mechanism, Serial-Pair, achieving the upper bound of 3, while the lower bound is 5/2. The appendix introduces a different universally strategyproof mechanism, Mixed-Percentile, designed to close this gap and achieve the conjectured optimal upper bound of 5/2.

The proposed mechanism combines weighted-percentile serial components with a pair-based component, with parameters depending on the numbers of singleton and doubleton agents. The authors verify universal strategyproofness, but explicitly state that the computer-generated proof of its 5/2 approximation guarantee is too complex to verify reliably and therefore do not claim the bound as established. Proving this guarantee would determine the exact optimal approximation ratio for universally strategyproof mechanisms on the line.

References

In cref{app:line52}, we present a mechanism that we conjecture to achieve an upper bound of $5/2$ in terms of the social cost on the line.

— Truthful Two-Facility Location with Candidate Locations in Metric Spaces  (2610.18006 - Kanellopoulos et al., 13 Oct 2026) in Section 1, subsection “Our Contribution,” footnote to the line-results paragraph; see also Appendix, Section “Conjectured Tight 5/2 Upper Bound on the Line”