Checking justified representation in temporal elections is coNP-hard in general, even with two or three candidates, though monotonic preferences make all six axioms checkable in polynomial time.
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
-
Verifying Proportionality in Temporal Voting
Checking justified representation in temporal elections is coNP-hard in general, even with two or three candidates, though monotonic preferences make all six axioms checkable in polynomial time.