A note on a consistency property for permutations

In cooperative game theory allocation of earnings to players may take place on the basis of selectors or—more restrictively—consistent selectors, or on the basis of a permutation representing the queueing of the players. This note gives a graph theoretic characterization of those situations in which the latter allocation method results in allocation with consistent selectors.