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 foreach my $iv (@invotes) {
61 my ($votestr,$voter) = @$iv;
63 length $votestr eq @choices or die "wrong vote vector length";
64 my @vs = split //, $votestr;
65 foreach my $ix (0..$#vs) {
69 } elsif ($vchr =~ m/[0-9a-z]/) {
70 $vs[$ix] = ord($vchr);
75 foreach my $ia (0..$#vs) {
76 foreach my $ib ($ia+1..$#vs) {
79 if ($va < $vb) { push @{ $vab[$ia][$ib] }, $voter }
80 elsif ($vb < $va) { push @{ $vab[$ib][$ia] }, $voter }
84 die "voter $voter $@" if $@;
87 our @ch = map { $choices{$_} } @choices;
89 # Print the counts V(A,B)
90 foreach my $iy (-2..$#ch) {
91 foreach my $ix (-2..$#ch) {
100 } elsif ($ix==-2 && $iy==-2) {
103 printf "%5s ", $choices[$ix];
105 printf "%5s ", $choices[$iy];
107 my $v = \( $vab[$iy][$ix] );
110 printf "%5d ", (scalar @$$v);
121 print "dropping $choices[$i]: $why\n";
122 $ch[$i]{Dropped} = $why;
125 print "# quorum A.6(2)\n";
127 foreach my $i (0..$#choices) {
128 next if $ch[$i]{Dropped};
130 my $v = $vab[$i][$defi];
131 next if $v >= $quorum;
132 drop $i, "quorum ($v < $quorum)";
135 print "# maj. ratio A.6(3)\n";
137 foreach my $i (0..$#choices) {
138 next if $ch[$i]{Dropped};
140 my $majr = $ch[$i]{Smaj};
141 $majr ||= [1,1]; # A.6(3)(3)
142 my $vad = scalar @{ $vab[$i][$defi] };
143 my $vda = scalar @{ $vab[$defi][$i] };
144 next if $vad * $majr->[1] > $vda * $majr->[0];
145 drop $i, "majority ratio ($vad * $majr->[1] <= $vda * $majr->[0])";
148 my $defeats = Graph::Directed->new; # A.6(4)
151 return grep { !$ch[$_]{Dropped} } (0..$#ch);
154 foreach my $ia (chremain()) {
155 $defeats->add_vertex($ia);
156 foreach my $ib (chremain()) {
157 my $vab = scalar @{ $vab[$ia][$ib] };
158 my $vba = scalar @{ $vab[$ib][$ia] };
159 next unless $vab > $vba;
160 print "defeat: $choices[$ia] beats $choices[$ib] ($vab > $vba)\n";
161 $defeats->add_vertex($ia,$ib);
167 my ($def1,$def2) = @_;
168 my ($ia,$ix) = @$def1;
169 my ($ib,$iy) = @$def1;
170 return 1 if $vab[$ia][$ix] < $vab[$ib][$iy];
171 return 1 if $vab[$ia][$ix] == $vab[$ib][$iy]
172 && $vab[$ix][$ia] > $vab[$iy][$ib];
176 print "defeats graph: $defeats\n";
183 print "# transitive closure A.6(5)\n";
185 my $tdefeats = $defeats->transitive_closure();
187 print "closure graph: $tdefeats\n";
189 print "# Schwartz set A.6(6)\n";
191 $schwartz = $defeats->copy();
193 foreach my $ia (chremain()) {
194 foreach my $ib (chremain()) {
195 next if $tdefeats->has_edge($ia,$ib);
196 next if !$tdefeats->has_edge($ib,$ia);
197 print "not in Schwartz set: $choices[$ia] because $choices[$ib]\n";
198 $schwartz->delete_vertex($ia);
203 print "# dropping weakest defeats A.6(7)\n";
207 foreach my $edge ($schwartz->edges()) {
209 # no weakest edges yet
210 } elsif (weaker($edge, $weakest[0])) {
211 # this edge is weaker than previous weakest, start new set
213 } elsif (weaker($weakest[0], $edge)) {
214 # weakest edge is weaker than this one, ignore this one
217 # weakest edge is exactly as weak as this one, add this one
219 push @weakest, $edge;
222 last unless @weakest;
224 printf "weakest defeats %d > %d",
225 (scalar @{ $vab[$_->[0]][$_->[1]] }),
226 (scalar @{ $vab[$_->[1]][$_->[0]] });
227 foreach my $weakest (@weakest) {
228 my ($ia,$ib) = @$weakest;
229 print "weakest defeat $choices[$ia] > $choices[$ib]\n";
230 $defeats->delete_edge($ia,$ib);
233 print "# defeats within the Schwartz set, round again\n";
236 print "# no defeats within the Schwartz set\n";
237 print "FINAL SCHWARTZ SET:\n";
239 printf " %-5s %s\n", $choices[$_], $ch[$_]{Desc}
240 foreach ($schwartz->vertices());