RE: What is Data Model FOR?

From: Mark Winegar <mwinegar_at_mtmc_dot_edu>
Date: Thu Apr 29 2004 - 10:36:09 CDT

Doug,

You may be able to implement the canvassing of ranked preference votes
as a simple array of contests. This should simplify the required logic
of the canvassing process.

Mark Winegar

-----Original Message-----
From: Douglas W. Jones [mailto:jones_at_cs_dot_uiowa_dot_edu]
Sent: Thursday, April 29, 2004 10:27 AM
To: voting-project@lists.sonic.net
Subject: Re: [voting-project] What is Data Model FOR?

On Apr 29, 2004, at 12:48 AM, David Mertz wrote:

> dr-jekyll@att.net wrote:
> |Does "vote aggregation" mean vote totals? The Data Model I submitted

> |does have a place for accumulating vote totals.
>
> Aggregation is likely to involve move than a simple counter. Maybe
> the counter suffices for a first pass, on some kinds of races. But
> consider, for example either N of M or ranked-preference contests.
> The tallying of rank orders involves more than just counting the
> votes; for example, in IRV, it would go through stages with
> reassignments of votes and recounts.

I should note that the canvassing rules I proposed in my previous post
don't apply directly to ranked preference votes, but there are
generalizations that do apply. Designing canvassing procedures that
allow for self-audit throughout the process is most difficult for IRV or
STV systems. It is easier for weighted preference systems.

                Doug Jones
                jones@cs.uiowa.edu
==================================================================
= The content of this message, with the exception of any external
= quotations under fair use, are released to the Public Domain
==================================================================
Received on Fri Apr 30 23:17:22 2004

This archive was generated by hypermail 2.1.8 : Fri Apr 30 2004 - 23:17:29 CDT