tau. It consists of computing number of intersections resulting from connecting the two rankings of each member by lines, one ranking having been put in natural order, and computing tau from the number of intersections. In the case of ties in both rankings, Griffin suggests the construction of four graphs, for each of which the number of intersections is computed. Tau is then computed from the sum of the four sets of intersections. The purpose of this note is to suggest that only two of the four graphs are necessary, say those in which the differences in ranking from that given by the natural order are minimized in both sets, and then maximized in both sets. If one doubles the total number of intersections found in these two graphs, the values of 4s, required for the computation of tau, can be found. That this is sufficienit can be seen by numbering the columns in the table at the top of page 447 and noting that the sum of the entries in columns 1 and 4 equals the sum in columns 1 and 2. If one wishes to check the value obtained, the computation may be repeated using the other pair of graphs.