Self-consistency of voting implies majority vote

Artur Poplawski

Self-consistency of voting implies majority vote

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1807.00170 v1 pith:G42BDOSX submitted 2018-06-30 cs.GT

Artur Poplawski This is my paper · ORCID

classification cs.GT

keywords majorityvotecharacterizationkennethvotingalternativeapproachesarrow

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

Paper develops axiomatic characterization of the family of majority vote rules in the way alternative to characterization of the majority vote given in paper of Kenneth O. May in the 1952. This, similar but different, axiomatics focuses on the consistency of the voting procedure. Both approaches are compared. Relation to famous Kenneth J. Arrow's Impossibility Theorem is also discussed.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Backdoor Attack on Vision Language Models with Stealthy Semantic Manipulation
cs.CV 2025-06 conditional novelty 7.0 of 10

BadSem shows that semantic mismatches between images and text can serve as stealthy backdoor triggers for VLMs, achieving near-perfect attack success with low poisoning rates.

Pith tools