[EM] Uncountable Ballot

[josh at narins.net]

On Wed, May 07, 2003 at 11:47:03AM +0000, josh at narins.net wrote:
> On Wed, May 07, 2003 at 02:02:19AM -0500, Adam Tarr wrote:
> > Josh Narins wrote:
> > 
> > >> > ex.
> > >> >      A   B   C   D
> > >> >    / -------------
> > >> > A  | x   B   A   D
> > >> > B  | B   x   C   B
> > >> > C  | A   C   x   C
> > >> > D  | D   B   C   x
> > >> >
> > >
> > >On this individual ballot, there is this cycle...
> > >A beats C, C beats D, D beats A
> > >so it certainly can't be represented as a ranked ballot, so can not be
> > >counted with the methods that I have ever heard of.
> > 
> > I see no reason why these ballots couldn't be summed and evaluated using a 
> > standard Condorcet method such as ranked pairs.
> > 
> 

OH!

Sorry for being daft.

I still think its a better ballot for the reason that no voter ever has
to compare any two candidates they do not want, and it allows for a much
fuller expression of voter desire.