Axiomatic sufficient conditions and a full characterization for electoral control type separations, applied to seven voting systems to yield 64 new collapses and 1901 new separations plus universally separating pairs.
The Computational Difficulty of Manipulating an Election.Social Choice and Welfare1989,6(3), 227–241
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Biprofile deviation logic proves soundness and completeness of H_bp for Dev(N) frames and introduces typed manipulation witnesses, boundary-row theorem, and factor-closure criterion for auditing report changes.
citing papers explorer
-
Axiomatic Tools for Separating Electoral Control Types, with Applications to Concrete Systems
Axiomatic sufficient conditions and a full characterization for electoral control type separations, applied to seven voting systems to yield 64 new collapses and 1901 new separations plus universally separating pairs.
-
Biprofile Deviation Logic: Report-Replacement Frames and Audit Witnesses
Biprofile deviation logic proves soundness and completeness of H_bp for Dev(N) frames and introduces typed manipulation witnesses, boundary-row theorem, and factor-closure criterion for auditing report changes.