Cooperative aspects of multiple criteria decision making with respect to cost allocation in a network will be studied.The vector valued costs of a graph that connects a group of geographically scattered users to a common source have to be distributed among the users.Here a specific class of cost allocation rules , the so-called Bird rules, are studied.Bird allocations can be determined by means of a greedy algorithm.This algorithm is based on an order on the edge set. Three different orders and their Bird rules are studied.Two of the three associated Bird allocation rules will be characterized.Those two constitute a refinement of the set of stable cost allocations of the multiple criteria minimum cost spanning tree problem.