Demand-Independent Tolls

Wardrop equilibria in nonatomic congestion games are in general inefficient as they do not induce an optimal flow that minimizes the total travel time. Tolls can be used to induce an optimum flow in equilibrium. The classical approach to find such tolls is marginal cost pricing. This requires the exact knowledge of the demand on the network. In this paper, we investigate under which conditions tolls exist that are independent of the demand in the network. We call them demand-independent optimum tolls (DIOTs). We show that such tolls exist when the cost functions are shifted monomials. Moreover non-negative DIOTs exist when the network is a directed acyclic multi-graph. Finally, we show that any network with a single origin-destination pair admits DIOTs that, although not necessarily non-negative, satisfy a budget constraint.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2022

Exact Flow Sparsification Requires Unbounded Size

Given a large edge-capacitated network G and a subset of k vertices call...
research
12/20/2017

Selfishness need not be bad

This article studies the user selfish behavior in non-atomic congestion ...
research
07/04/2022

Non-Blind Strategies in Timed Network Congestion Games

Network congestion games are a convenient model for reasoning about rout...
research
05/31/2018

Computing all Wardrop Equilibria parametrized by the Flow Demand

We develop an algorithm that computes for a given undirected or directed...
research
09/08/2017

Applications of an algorithm for solving Fredholm equations of the first kind

In this paper we use an iterative algorithm for solving Fredholm equatio...

Please sign up or login with your details

Forgot password? Click here to reset