For spatial voting with interval-uncertain voter positions, possible-winner problems are polynomial-time solvable for k-truncated rules in 1D, FPT in the number of candidates in all dimensions, yet NP-complete for weighted approval-like rules in 1D.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Finding Possible Winners in Spatial Voting with Incomplete Information
For spatial voting with interval-uncertain voter positions, possible-winner problems are polynomial-time solvable for k-truncated rules in 1D, FPT in the number of candidates in all dimensions, yet NP-complete for weighted approval-like rules in 1D.