Description Usage Arguments Author(s) References See Also Examples
Finds a p-value through the LKP Bound: a continuous relaxation bound of the original 0-1 knapsack problem. Offers an option to include a lower-bound in output, thus computing an upper and lower bound on the exact p-value. See Higgins, Rivest, Stark for more details.
1 2 3 4 |
Z |
A |
t |
Value of the observed maximum, either as the MRO, as taint, or as the overstatement of the margin in votes. |
asTaint |
Set |
asNumber |
Set |
M |
A priori margin. If NULL, |
takeOutZeroMMB |
Setting |
LKP.lower.bound |
Set |
bound.col, calc.e_p, w_p |
Arguments used to compute
|
Mike Higgins, Hua Yang
M. Higgins, R. L. Rivest, P. B. Stark. Sharper p-Values for Stratified Election Audits
See eqValBound
and withReplaceBound
for finding a p-value through other relaxations.
See BaB
for finding an exact p-value
through solving a 0-1 knapsack problem.
See compute.stark.t
for computing t
through audit data.
1 2 3 4 5 6 7 8 | data(MN_Senate_2006)
LKPBound(MN_Senate_2006.strat, takeOutZeroMMB = FALSE)
LKPBound(MN_Senate_2006.strat, t = 2, asNumber = TRUE,
takeOutZeroMMB = FALSE, LKP.lower.bound = TRUE)
data(CA_House_2008)
CA_House_2008.strat[[1]]$strat$audit <- 1
LKPBound(CA_House_2008.strat[[1]], t = 0, LKP.lower.bound = TRUE)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.