Optimal Candidate Positioning in Multi-Issue Elections

TL;DR

This paper analyzes the complexity of candidate positioning in multidimensional spatial elections, providing algorithms for tractable cases and approximation guarantees for multi-candidate scenarios, with implications for campaign strategies.

Contribution

It introduces the first exact algorithms for candidate placement in low dimensions and extends geometric methods to positional scoring rules, advancing understanding of election strategy.

Findings

Computing optimal candidate location is NP-hard against a single opponent.

Exact algorithms are available for low-dimensional cases, such as $O(n^{d+1})$ and $O(n ext{log} n)$ routines.

The paper offers the first approximation guarantees for multi-candidate spatial elections.

Abstract

We study strategic candidate positioning in multidimensional spatial-voting elections. Voters and candidates are represented as points in $\mathbb{R}^d$, and each voter supports the candidate that is closest under a distance induced by an $\ell_p$-norm. We prove that computing an optimal location for a new candidate is NP-hard already against a single opponent, whereas for a constant number of issues the problem is tractable: an $O(n^{d+1})$ hyperplane-enumeration algorithm and an $O(n \log n)$ radial-sweep routine for $d=2$ solve the task exactly. We further derive the first approximation guarantees for the general multi-candidate case and show how our geometric approach extends seamlessly to positional-scoring rules such as $k$-approval and Borda. These results clarify the algorithmic landscape of multidimensional spatial elections and provide practically implementable tools for campaign strategy.