Skip to content
DraconiticResearch
Search Sources API
194,220 studies31 sourcesUpdated 13 min ago
PreprintarXiv licencearXiv

The Deterministic Hare Core Is Nonempty for Nine-Seat Approval Elections

Abstract

Core stability gives approval-based committee elections a strong form of coalitional proportionality, but deterministic existence is not known for an arbitrary number of seats. We prove that every finite election with nine seats has a deterministic Hare-quota core committee. Starting from an eight-seat committee that is both a global Proportional Approval Voting (PAV) maximizer and core stable, we suppose that all one-candidate extensions are blocked and extract an inclusion-minimal closed response system. Singleton responses are eliminated by exact equality rigidity. For the remaining responses, rational Farkas certificates bound every nonpositive PAV add-marginal drift below by −n/189 and force every successor drift above n/126. The uniform response chain is irreducible, so stationarity makes these bounds incompatible. The computer-assisted component comprises an exact pointwise check over 7,356 voter types, 36 one-blocker cells, and a symmetry-complete family of 19 two-blocker motifs. Exact certificate archives and standard-library verifiers support these checks. The theorem settles the nine-seat case but does not decide deterministic core existence for arbitrary committee size.

Related

  1. A proof of Hare's ε unfair conjecture
    Tho Nguyen Xuan, Duc Hiep Pham, Huong Pham Lan
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. An autocomplete model for elections
    Moon Duchin, Kristopher Tapp
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
  3. Mapping and quantifying engagement levels of governments in IPCC approval meetings by topic from text
    Patrick Bayer, Lorenzo Crippa, Hannah Hughes +1
    PLOS ClimatePeer-reviewedCC BY 4.0Full textClimate scienceStatisticsPLOS
  4. Asymptotic expansion of smooth functions in deterministic and iid Haar unitary matrices, and application to tensor products of matrices
    Félix Parraud
    The Annals of ProbabilityPeer-reviewedLicence not statedFull text10 citedStatisticsOpenAlex
  5. A sequential quadratic programming method for optimization with expectation objective functions, deterministic inequality constraints and robust subproblems
    Songqiang Qiu, Vyacheslav Kungurtsev
    IMA Journal of Numerical AnalysisPeer-reviewedLicence not statedFull text14 citedNumerical analysis & scientific computingOpenAlex
BibTeX
@misc{fang2026deterministic,
  title = {{The Deterministic Hare Core Is Nonempty for Nine-Seat Approval Elections}},
  author = {Jiarui Fang},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.04497},
  eprint = {2609.04497},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.04497},
}
RIS
TY  - UNPB
TI  - The Deterministic Hare Core Is Nonempty for Nine-Seat Approval Elections
AU  - Jiarui Fang
PY  - 2026
DA  - 2026/09/03
PB  - arXiv
DO  - 10.48550/arxiv.2609.04497
UR  - https://arxiv.org/abs/2609.04497
AB  - Core stability gives approval-based committee elections a strong form of coalitional proportionality, but deterministic existence is not known for an arbitrary number of seats. We prove that every finite election with nine seats has a deterministic Hare-quota core committee. Starting from an eight-seat committee that is both a global Proportional Approval Voting (PAV) maximizer and core stable, we suppose that all one-candidate extensions are blocked and extract an inclusion-minimal closed response system. Singleton responses are eliminated by exact equality rigidity. For the remaining responses, rational Farkas certificates bound every nonpositive PAV add-marginal drift below by −n/189 and force every successor drift above n/126. The uniform response chain is irreducible, so stationarity makes these bounds incompatible. The computer-assisted component comprises an exact pointwise check over 7,356 voter types, 36 one-blocker cells, and a symmetry-complete family of 19 two-blocker motifs. Exact certificate archives and standard-library verifiers support these checks. The theorem settles the nine-seat case but does not decide deterministic core existence for arbitrary committee size.
ER  -