Abstract. In this paper we reconsider Pretty Good Democracy, a scheme for verifiable Internet voting from untrusted client machines. The original scheme worked for first-past-the-post elections. Here we show how PGD can be extended to voting schemes in which the voter lists the candidates in their order of preference. Our scheme applies to elections using STV, IRV, Borda, or any other tallying scheme in which a vote is a list of candidates in preference order. We also describe an extension to Approval or Range voting.
PGD was later enhanced to support expressive voting schemes in which the voter lists the candidates in order of preference REF .
Pretty good democracy for more expressive voting schemes
ESORICS
Computer Science