Destructive partition-of-voters criterion for approval (TE) is decidable in polynomial time
OpenHHRControl.PV.approval_te_dc_criterion_mem_Pcomputational-complexityelection-controlsocial-choice
Let be the candidates, the distinguished candidate and a list of voters. Each voter casts an approval ballot . Say that satisfies the approval-TE dethroning criterion if there are (possibly equal) with
By the reduction submitted for Theorem 4.21, this holds exactly when can be made not the unique winner by partition of voters in model TE. The case says that ties or beats in total approvals.
Claim. The set of binary codes electionCode of the instances satisfying the criterion is in P: some one-tape Turing machine decides it in polynomial time. (The test loops over at most candidate pairs and counts voters, which takes time polynomial in the code length.)
Preamble
import Mathlib import Definitions.Def_CookPvsNP_defs import Definitions.Def_ProjSchedTW_Complexity_Encoding import Definitions.Def_HHRControl_PV_Elections import Definitions.Def_HHRControl_PV_Languages
Formal statement
namespace HHRControl.PV
open CookPvsNP ProjSchedTW.Complexity Finset
/-- The polynomial-time test behind destructive control by partition of voters for approval voting in model TE (Theorem 4.21, p. 19)
(Hemaspaandra–Hemaspaandra–Rothe): the codes of the elections satisfying the dethroning criterion
form a language in P. -/
theorem approval_te_dc_criterion_mem_P :
{ w : List BSym | ∃ (m n : ℕ) (c : Fin m) (P : Fin n → Approval m),
(∃ y z : Fin m, y ≠ c ∧ z ≠ c ∧
(univ.filter fun v => c ∈ P v ∧ y ∉ P v ∧ z ∉ P v).card ≤
(univ.filter fun v => c ∉ P v ∧ (y ∈ P v ∨ z ∈ P v)).card) ∧
w = electionCode approval c P } ∈ CookPvsNP.P BSym := by sorry
end HHRControl.PV
Source
Hemaspaandra, Hemaspaandra & Rothe, Anyone but Him: The Complexity of Precluding an Alternative, Artificial Intelligence 171 (2007), arXiv:cs/0507027v5, p. 19, proof of Theorem 4.21 (model TE)