View article

The purpose of this paper is to introduce a novel family of transferable utility games related to congested networks. We assume that players are traffic coordinators, who explicitly route their deliveries in the network. The costs of the players are determined by the total latency of the deliveries, which in turn can be calculated by the edge latency functions. Since the edge latency functions assign a latency value to the total flow on the corresponding edge, as cooperating players redesign their routing in order to minimize their overall cost, outsiders will be affected as well. This gives rise to externalities therefore the resulting game is described in partition function form. We show that cooperation may imply both negative and positive externalities in the defined game. We assume that coalitions may determine their routing according to different predictive strategies. We show that the increasing order of predictive …