CPAR voting: Difference between revisions

imported>Homunq
(temporary holding page)
 
 
(4 intermediate revisions by one other user not shown)
Line 1:
This is a temporary page.
 
Prefer Accept Reject (PAR) voting works as described below:
 
Line 4 ⟶ 6:
# Candidates with a majority of Reject, or with under 25% Prefer, are eliminated, unless that would eliminate all candidates.
# Tally "prefer" ratings for all non-eliminated candidates.
# Find the leader in this tally, and add in "accept" ratings on ballots that don't prefer the leader (if they haven't already been counted).
# Repeat step 4 until the leader doesn't change. The winner is the final leader.
 
Line 15 ⟶ 17:
== Criteria compliance ==
 
PAR voting passes the [[favorite betrayal criterion]], the [[majority criterion]], the [[mutual majority criterion]], [[Local independence of irrelevant alternatives]] (under the assumption of fixed "honest" ratings for each voter for each candidate), [[Independence of clone alternatives]], [[Monotonicity]], [[polytime]], [[resolvability]], and the [[later-no-help criterion]].
 
Doesn't pass the [[favorite betrayal criterion]], see mailing list or talk page for details.
 
There are a few criteria for which it does not pass as such, but where it passes related but weaker criteria. These include:
Line 75 ⟶ 79:
(If Memphis voters rejected Nashville, then Chattanooga or Knoxville could win by conspiring to reject Nashville and accept Memphis. However, Nashville could stop this by rejecting them. Thus this strategy would not work without extreme foolishness from both Memphis and Nashville voters, and extreme amounts of strategy from the others.)
[[Category:Graded Bucklin systemsmethods]]