Aug 20, 2015 · This paper presents a practical branch-and-bound algorithm for exact IRV margin computation that substantially improves on the current best-known approach.

Abstract. Computing the margin of victory (MOV) in an Instant. Runoff Voting (IRV) election is NP-hard. In an IRV election with.

This paper presents a practical branch-and-bound algorithm for exact IRV margin computation that substantially improves on the current best-known approach ...

Abstract. Computing the margin of victory (MOV) in an Instant. Runoff Voting (IRV) election is NP-hard. In an IRV election with.

This paper presents a practical branch-and-bound algorithm for exact IRV margin computation that substantially improves on the current best-known approach.

Aug 29, 2016 · Computing the margin of victory (MOV) in an Instant Runoff Voting (IRV) election is NP-hard. In an IRV election with winning candidate w, ...

Although exponential in the worst case, our algorithm runs efficiently in practice, computing margins in instances that could not be solved by the current state ...

Notes: This code implements the branch-and-bound margin computation algorithm described by Blom et al. in "Efficient Computation of Exact IRV Margins" presented ...

Aug 8, 2011 · each ballot signature in an IRV election. ®Represented by a table like below. Ballot Signature Count. (Alice, Cass, Bob) ...

So far, most post-election auditing techniques were designed specifically for elections that use the plurality rule, where each voter votes for a single ...