Strong coalitional equilibrium in a transportation game

This paper introduces an extension of the vehicle routing problem by involving several decision makers in competition. Each customer is characterized by demand and distance to the warehouse. The problem is described in form of a cooperative transportation game (CTG). We consider customers as players in the game. Their strategies are the routes for a vehicle they should rent in a coalition to deliver goods subject to their demand with minimal transportation costs, under the assumption that transportation costs are allocated between the players according to the Nash arbitration scheme. For each profile in coalitional strategies, we define a coalitional structure of players and the costs of each player. A strong equilibrium is found for the cooperative transportation game. In addition, we develop a procedure to calculate the strong equilibrium. This procedure is illustrated by a numerical example.