9 binmode STDIN, 'encoding(UTF-8)';
10 binmode STDOUT, 'encoding(UTF-8)';
11 binmode STDERR, 'encoding(UTF-8)';
20 my $choname = shift @_;
21 my $cho = $choices{$choname} = { @_, Index => (scalar @choices) };
22 push @choices, $choname;
30 if (m/^([A-Z]+)\s*\=\s*(\S.*)$/) {
31 my ($choname, $desc) = ($1,$2);
32 my $cho = addchoice($choname, Desc => $desc);
33 if ($desc =~ m/\[(\d+):(\d+)\]/) {
34 $cho->{Smaj} = [$1,$2];
35 } elsif ($desc =~ m/\[default\]/) {
38 } elsif (m/^V:\s+(\S+)\s+(\S.*)/) {
39 push @invotes, [ $1, $2 ];
40 } elsif (m/^quorum = ([0-9.]+)$/) {
47 $defcho ||= $choices{FD};
49 $defcho = addchoice('FD', Desc => "Further Discussion");
51 my $defi = $defcho->{Index};
52 die "FD has smaj?!" if $defcho->{Smaj};
55 # $vab[$ia][$ib] = V(A,B)
56 # Actually, it's a list of voters who prefer A to B (A.6(3)(1))
58 # Go through the voters and construct V(A,B)
60 print "\nDefeats matrix\n";
62 foreach my $iv (@invotes) {
63 my ($votestr,$voter) = @$iv;
65 length $votestr eq @choices or die "wrong vote vector length";
66 my @vs = split //, $votestr;
67 foreach my $ix (0..$#vs) {
71 } elsif ($vchr =~ m/[0-9a-z]/) {
72 $vs[$ix] = ord($vchr);
77 foreach my $ia (0..$#vs) {
78 foreach my $ib ($ia+1..$#vs) {
81 if ($va < $vb) { push @{ $vab[$ia][$ib] }, $voter }
82 elsif ($vb < $va) { push @{ $vab[$ib][$ia] }, $voter }
86 die "voter $voter $@" if $@;
89 our @ch = map { $choices{$_} } @choices;
91 # Print the counts V(A,B)
92 foreach my $iy (-2..$#ch) {
93 foreach my $ix (-2..$#ch) {
102 } elsif ($ix==-2 && $iy==-2) {
105 printf "%5s ", $choices[$ix];
107 printf "%5s ", $choices[$iy];
109 my $v = \( $vab[$iy][$ix] );
112 printf "%5d ", (scalar @$$v);
123 print "dropping $choices[$i]: $why\n";
124 $ch[$i]{Dropped} = $why;
127 print "\nQuorum A.6(2) (quorum is $quorum)\n";
129 foreach my $i (0..$#choices) {
130 next if $ch[$i]{Dropped};
132 my $v = $vab[$i][$defi];
133 next if $v >= $quorum;
134 drop $i, "quorum ($v < $quorum)";
137 print "\nMajority ratio A.6(3)\n";
139 foreach my $i (0..$#choices) {
140 next if $ch[$i]{Dropped};
142 my $majr = $ch[$i]{Smaj};
143 $majr ||= [1,1]; # A.6(3)(3)
144 my $vad = scalar @{ $vab[$i][$defi] };
145 my $vda = scalar @{ $vab[$defi][$i] };
146 next if $vad * $majr->[1] > $vda * $majr->[0];
147 drop $i, "majority ratio ($vad * $majr->[1] <= $vda * $majr->[0])";
150 my $defeats = Graph::Directed->new; # A.6(4)
153 return grep { !$ch[$_]{Dropped} } (0..$#ch);
156 foreach my $ia (chremain()) {
157 $defeats->add_vertex($choices[$ia]);
158 foreach my $ib (chremain()) {
159 my $vab = scalar @{ $vab[$ia][$ib] };
160 my $vba = scalar @{ $vab[$ib][$ia] };
161 next unless $vab > $vba;
162 print "defeat: $choices[$ia] beats $choices[$ib] ($vab > $vba)\n";
163 $defeats->add_vertex($choices[$ia],$choices[$ib]);
169 return $vab[ $choices{$ca}{Index} ][ $choices{$cb}{Index} ];
174 my ($def1,$def2) = @_;
175 my ($ca,$cx) = @$def1;
176 my ($cb,$cy) = @$def1;
177 return 1 if chvab($ca, $cx) < chvab($cb, $cy);
178 return 1 if chvab($ca, $cx) == chvab($cb, $cy)
179 && chvab($cx, $ca) > chvab($cy, $cb);
188 print "defeats graph: $defeats\n";
190 print "\nTransitive closure A.6(5)\n";
192 my $tdefeats = $defeats->transitive_closure();
194 print "closure graph: $tdefeats\n";
196 print "\nSchwartz set A.6(6)\n";
198 $schwartz = $defeats->copy();
200 foreach my $ia (chremain()) {
201 foreach my $ib (chremain()) {
202 next if $tdefeats->has_edge($choices[$ia],$choices[$ib]);
203 next if !$tdefeats->has_edge($choices[$ib],$choices[$ia]);
204 print "not in Schwartz set: $choices[$ia] because $choices[$ib]\n";
205 $schwartz->delete_vertex($ia);
210 print "\nDropping weakest defeats A.6(7)\n";
214 foreach my $edge ($schwartz->edges()) {
216 # no weakest edges yet
217 } elsif (weaker($edge, $weakest[0])) {
218 # this edge is weaker than previous weakest, start new set
220 } elsif (weaker($weakest[0], $edge)) {
221 # weakest edge is weaker than this one, ignore this one
224 # weakest edge is exactly as weak as this one, add this one
226 push @weakest, $edge;
229 last unless @weakest;
231 printf "weakest defeats %d > %d",
232 (scalar @{ $vab[$_->[0]][$_->[1]] }),
233 (scalar @{ $vab[$_->[1]][$_->[0]] });
234 foreach my $weakest (@weakest) {
235 my ($ia,$ib) = @$weakest;
236 print "weakest defeat $choices[$ia] > $choices[$ib]\n";
237 $defeats->delete_edge($choices[$ia],$choices[$ib]);
240 print "defeats within the Schwartz set, round again\n";
243 print "no defeats within the Schwartz set\n";
244 print "final schwartz set:\n\n";
246 if ($schwartz->vertices() == 1) {
247 print "WINNER IS:\n";
249 print "WINNER IS ONE OF (CASTING VOTE DECIDES):\n";
252 printf " %-5s %s\n", $_, $choices{$_}{Desc}
253 foreach ($schwartz->vertices());