dirtree {elections.dtree} | R Documentation |
dirtree
is used to create a Dirichlet-tree for modelling ballots,
as described by Everest et al. (2022).
dirtree(
candidates,
min_depth = 0,
max_depth = length(candidates),
a0 = 1,
vd = FALSE
)
candidates |
A character vector, with each element (must be unique) representing a single candidate. |
min_depth |
The minimum number of candidates which must be specified for a valid ballot. |
max_depth |
The maximum number of candidates which can be specified for a valid ballot. |
a0 |
The prior parameter for the distribution. |
vd |
A flag which, when |
A Dirichlet-tree representing ranked ballots, as an object of class
dirichlet_tree
.
Everest F, Blom M, Stark PB, Stuckey PJ, Teague V, Vukcevic D (2022). “Ballot-Polling Audits of Instant-Runoff Voting Elections with a Dirichlet-Tree Model.” doi:10.48550/ARXIV.2209.03881..
Everest F, Blom M, Stark PB, Stuckey PJ, Teague V, Vukcevic D (2022). “Auditing Ranked Voting Elections with Dirichlet-Tree Models: First Steps.” doi:10.48550/ARXIV.2206.14605..