wip

[appendix-a6.git] / parse

diff --git a/parse b/parse
index a7c6bc0b0f01e068df15becb8a81f04d7818bceb..e176ecc250713bf4e03b34a4ab3f6007f93dc64d 100755 (executable)
--- a/parse
+++ b/parse
@@ -3,6 +3,7 @@ use strict;
 use utf8;
 
 use Data::Printer;
+use Graph::Directed;
 
 binmode STDIN, 'encoding(UTF-8)' or die;
 binmode STDOUT, 'encoding(UTF-8)' or die;
@@ -11,11 +12,14 @@ binmode STDERR, 'encoding(UTF-8)' or die;
 our @choices;
 our %choices;
 our @invotes;
+our $defcho;
+our $quorum = 0;
 
 sub addchoice {
-    my $cho = shift @_;
-    $choices{$cho} = { @_, Index => (scalar @choices) };
-    push @choices, $cho;
+    my $choname = shift @_;
+    my $cho = $choices{$choname} = { @_, Index => (scalar @choices) };
+    push @choices, $choname;
+    return $cho;
 }
 
 while (<>) {
@@ -23,28 +27,34 @@ while (<>) {
     next if m/^\s*\#/;
     next unless m/\S/;
     if (m/^([A-Z]+)\s*\=\s*(\S.*)$/) {
-       my ($cho, $desc) = ($1,$2);
-       my $smaj;
+       my ($choname, $desc) = ($1,$2);
+       my $cho = addchoice($choname, Desc => $desc);
        if ($desc =~ m/\[(\d+):(\d+)\]/) {
-           $smaj = [$1,$2];
-       } 
-       addchoice($cho, Desc => $desc, Smaj => $smaj);
+           $cho->{Smaj} = [$1,$2];
+       } elsif ($desc =~ m/\[default\]/) {
+           $defcho = $cho;
+       }
     } elsif (m/^V:\s+(\S+)\s+(\S.*)/) {
        push @invotes, [ $1, $2 ];
+    } elsif (m/^quorum = ([0-9.]+)$/) {
+       $quorum = $1+0.0;
     } else {
        die "invalid input";
     }
 }
 
-if (!$choices{FD}) {
-    addchoice('FD', Desc => "Further Discussion");
+$defcho ||= $choices{FD};
+if (!$defcho) {
+    $defcho = addchoice('FD', Desc => "Further Discussion");
 }
+my $defi = $defcho->{Index};
+die "FD has smaj?!" if $defcho->{Smaj};
 
-our $chofd = $choices{FD};
-
-die "FD has smaj?!" if $chofd->{Smaj};
+our @vab;
+# $vab[$ia][$ib] = V(A,B)
+# Actually, it's a list of voters who prefer A to B (A.6(3)(1))
 
-our @vab; # $vab[$ia][$ib] = V(A,B)
+# Go through the voters and construct V(A,B)
 
 foreach my $iv (@invotes) {
     my ($votestr,$voter) = @$iv;
@@ -62,16 +72,128 @@ foreach my $iv (@invotes) {
            }
        }
        foreach my $ia (0..$#vs) {
-           foreach my $ib (0..$#vs) {
+           foreach my $ib ($ia+1..$#vs) {
                my $va = $vs[$ia];
                my $vb = $vs[$ib];
-               if ($va < $vb) { $vab[$ia][$ib]++; }
-               elsif ($vb < $va) { $vab[$ib][$ia]++; }
+               if ($va < $vb) { push @{ $vab[$ia][$ib] }, $voter }
+               elsif ($vb < $va) { push @{ $vab[$ib][$ia] }, $voter }
            }
        }
-    }
+    };
     die "voter $voter $@" if $@;
 }
 
-print p %choices;
-print p @vab;
+our @ch = map { $choices{$_} } @choices;
+
+# Print the counts V(A,B)
+foreach my $iy (-2..$#ch) {
+    foreach my $ix (-2..$#ch) {
+       if ($iy==-1) {
+           if ($ix==-1) {
+               printf "+" or die;
+           } else {
+               printf "------" or die;
+           }
+       } elsif ($ix==-1) {
+           printf "|" or die;
+       } elsif ($ix==-2 && $iy==-2) {
+           printf "V(Y,X)" or die;
+       } elsif ($iy==-2) {
+           printf "%5s ", $choices[$ix] or die $!;
+       } elsif ($ix==-2) {
+           printf "%5s ", $choices[$iy] or die $!;
+       } else {
+           my $v = \( $vab[$iy][$ix] );
+           $$v ||= [ ];
+           if (@$$v) {
+               printf "%5d ", (scalar @$$v) or die $!;
+           } else {
+               printf "%5s ", "" or die $!;
+           }
+       }
+    }
+    printf "\n" or die $!;
+}
+
+sub drop ($$) {
+    my ($i,$why) = @_;
+    print "dropping $choices[$i]: $why\n";
+    $ch[$i]{Dropped} = $why;
+}
+
+print "# quorum A.6(2)\n" or die $!;
+
+foreach my $i (0..$#choices) {
+    next if $ch[$i]{Dropped};
+    next if $i == $defi;
+    my $v = $vab[$i][$defi];
+    next if $v >= $quorum;
+    drop $i, "quorum ($v < $quorum)";
+}
+
+print "# maj. ratio A.6(3)\n" or die $!;
+
+foreach my $i (0..$#choices) {
+    next if $ch[$i]{Dropped};
+    next if $i == $defi;
+    my $majr = $ch[$i]{Smaj};
+    $majr ||= [1,1]; # A.6(3)(3)
+    my $vad = scalar @{ $vab[$i][$defi] };
+    my $vda = scalar @{ $vab[$defi][$i] };
+    next if $vad * $majr->[1] > $vda * $majr->[0];
+    drop $i, "majority ratio ($vad * $majr->[1] <= $vda * $majr->[0])";
+}
+
+my $defeats = Graph::Directed->new; # A.6(4)
+
+foreach my $ia (0..$#ch) {
+    foreach my $ib (0..$#ch) {
+       my $vab = $vab[$ia][$ib];
+       my $vba = $vab[$ib][$ia];
+       next unless $vab > $vba;
+       print "defeat: $choices[$ia] beats $choices[$ib] ($vab > $vba)\n"
+           or die $!;
+       $defeats->add_vertex($ia,$ib);
+    }
+}
+
+print "# transitive closure A.6(5)\n" or die $!;
+
+my $tdefeats = $defeats->transitive_closure();
+
+print "# schwartz set A.6(6)\n" or die $!;
+
+my $schwartz = $defeats->copy();
+
+foreach my $ia (0..$#ch) {
+    foreach my $ib (0..$#ch) {
+       next if $tdefeats->has_edge($ia,$b);
+       next if !$tdefeats->has_edge($b,$ia);
+       print "not in Schwartz set: $choices[$ia] because $choices[$ib]\n"
+           or die $!;
+       $schwartz->delete_vertex($ia);
+       last;
+    }
+}
+
+print "# dropping weakest defeats A.6(7)\n" or die $!;
+
+my @weakest = ();
+
+foreach my $edge (@{ $schwartz->edges() }) {
+    if (!@weakest) {
+       # no weakest edges yet
+    } elsif (weaker($edge, $weakest[0])) {
+       # this edge is weaker than previous weakest, start new set
+       @weakest = ();
+    } elsif (weaker($weakest[0], $edge)) {
+       # weakest edge is weaker than this one, ignore this one
+       next;
+    } else {
+       # weakest edge is exactly as weak as this one, add this one
+    }
+    push @weakest, $edge;
+}
+
+#p %choices;
+#p @vab;