IDENTIFICATION OF THE BRAESS PARADOX IN A STABLE DYNAMIC MODEL IN NETWORK WITH ONE SOURCE AND MULTIPLE SINKS

We study the problem of identifying edges in a transportation graph where the introduction of an additional toll would enhance the efficiency of network usage within the Nesterov–de Palma equilibrium model. The results of the authors for the single OD pair case, including the relationship between the travel times of the edges on the residual path and the travel time of the network, are extended to more general scenarios, specifically a network with one source and multiple sinks. We establish a connection between the sensitivity of total costs to changes in edge costs and the sensitivity of edge load to changes in network flow. We propose an algorithm to identify inefficient edges by exploiting the impact of small changes in the total network flow on the flow across individual graph edges.