seq_phragmen: Sequential Phragmen's Rule

View source: R/voting_methods.R

seq_phragmenR Documentation

Sequential Phragmen's Rule

Description

Sequential Phragmen's Rule is a multi-winner method that builds a committee by distributing representation loads across voters as evenly as possible. At each step, it selects the candidate that yields the smallest increase in voter load, then updates loads for voters who approved the chosen candidate. The process continues until the committee is filled or all candidates are ranked.

This function uses an internal C++ implementation for efficient computation.

Usage

seq_phragmen(
  voters,
  candidates,
  weights = NULL,
  committee_size = NULL,
  borda_score = TRUE,
  check = FALSE
)

Arguments

voters

(list())
A list of subsets (character vectors), where each subset contains the candidates approved or selected by a voter.

candidates

(character())
A vector of all candidates to be ranked.

weights

(numeric()|NULL)
A numeric vector of non-negative weights representing each voter's influence. Larger weight, higher influence. Must have the same length as voters. If NULL (default), all voters are assigned equal weights of 1, representing equal influence.

committee_size

(integer(1)|NULL)
Number of top-ranked candidates to return. Default (NULL) returns all candidates.

borda_score

(logical(1))
Whether to include a borda_score column in the output, which provides a normalized score based on the candidate's rank. If TRUE (default), the borda_score is calculated as (p - i) / (p - 1), where p is the total number of candidates and i is the candidate's rank.

check

(logical(1))
Whether to run additional voter-integrity checks. When TRUE, each voter must approve at least one candidate, approvals must be unique per voter, and all approved candidates must appear in candidates. Use FALSE to skip these checks when inputs are known to be valid.

Value

A data.frame with columns:

  • "candidate": Candidate names.

  • "borda_score": Borda scores for method-agnostic comparison, ranging in [0,1], where the top candidate receives a score of 1 and the lowest-ranked candidate receives a score of 0, based on the total number of candidates.

Candidates are ordered by the sequence in which they were selected.

See Also

Other voting methods: av(), sav(), seq_pav()


fastVoteR documentation built on May 16, 2026, 1:08 a.m.