Demand-Independent Optimal Tolls

@inproceedings{ColiniBaldeschi2018DemandIndependentOT,
  title={Demand-Independent Optimal Tolls},
  author={Riccardo Colini-Baldeschi and Max Klimm and M. Scarsini},
  booktitle={ICALP},
  year={2018}
}
Wardrop equilibria in nonatomic congestion games are in general inefficient as they do not induce an optimal flow that minimizes the total travel time. Network tolls are a prominent and popular way to induce an optimum flow in equilibrium. The classical approach to find such tolls is marginal cost pricing which requires the exact knowledge of the demand on the network. In this paper, we investigate under which conditions demand-independent optimum tolls exist that induce the system optimum flow… Expand
The Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable Flows
TLDR
This work analyzes the minimum tollbooth problem in atomic network congestion games with unsplittable flows and presents a polynomial time algorithm for networks on series-parallel graphs that turns any given state of the untolled game into a pure Nash equilibrium of the tolled game with the minimum number of tolled edges. Expand
The Price of Anarchy in Routing Games as a Function of the Demand
TLDR
This paper establishes some smoothness properties of Wardrop equilibria and social optima for general smooth costs and deduces that for affine costs the maximum of the price of anarchy can only occur at the break points, and for general costs provides counterexamples showing that the set of break points is not always finite. Expand
Uncertainty in Multicommodity Routing Networks: When Does It Help?
TLDR
Contrary to the usual notion that uncertainty increases inefficiencies, network congestion decreases when users overestimate their costs, and “caution in the face of uncertainty” leads to favorable network conditions. Expand
A Probabilistic Divide and Conquer Algorithm for the Minimum Tollbooth Problem
TLDR
A variant of this problem, the minimum tollbooth problem, which additionally minimizes the number of tolled edges, is considered, which implies a provable non-trivial upper bound on the (expected) runtime necessary to find an optimal solution. Expand
A separation logic for concurrent randomized programs
TLDR
The idea of coupling is extended to the setting of programs with both probabilistic and non-deterministic choice, and a variant of a randomized concurrent counter algorithm and a two-level concurrent skip list are verified. Expand

References

SHOWING 1-10 OF 45 REFERENCES
Efficiency of Restricted Tolls in Non-atomic Network Routing Games
TLDR
Borders show that restricted tolls can significantly reduce the price of anarchy if the restrictions imposed on arcs with high-degree polynomials are not too severe, and bounds are tight even for parallel-arc networks. Expand
Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games
TLDR
It is shown that tolls exist to induce the Nash equilibrium of general nonatomic congestion games to be system optimal, and an exponential bound on tolls is given that is independent of the number of network users and theNumber of commodities. Expand
Linear tolls suffice: New bounds and algorithms for tolls in single source networks
  • L. Fleischer
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2005
We show that tolls that are linear in the latency of the maximum latency path are necessary and sufficient to induce heterogeneous network users to independently choose routes that lead to trafficExpand
Cost-Balancing Tolls for Atomic Network Congestion Games
TLDR
This work shows how to compute in linear time a set of cost-balancing tolls for the optimal solution such that the total amount of tolls paid by any player in any pure Nash equilibrium of the modified game does not exceed the latency on the maximum-latency path in the optimal Solution. Expand
Computing network tolls with support constraints
TLDR
This work presents an analytical study for the special case of parallel edge networks highlighting the intrinsic complexity and nonconvexity of the resulting optimization problem and presents algorithms for general networks for which the solution quality for large-scale network instances is tested. Expand
MINIMAL-REVENUE CONGESTION PRICING PART II: AN EFFICIENT ALGORITHM FOR THE GENERAL CASE
TLDR
This paper derives an efficient solution to the minimal-revenue tolls problem by re-solves the single-origin problem of Part I, modeling it as a linear program and transforms the LP's dual into a simple longest-path problem on an acyclic network. Expand
Marginal cost pricing for Atomic Network Congestion Games
We study optimal tolls for network congestion games where players aim to route certain amount of traffic between various source destination pairs. We consider weighted ato mic users, unsplittableExpand
Congestion Toll Pricing of Traffic Networks
This paper concerns tolling methodologies for traffic networks which ensure that the resultant equilibrium flows are system optimal. A nonnegative vector β is defined to be a valid toll vector, ifExpand
Taxing Subnetworks
TLDR
This work studies taxes in the well-known game theoretic traffic model due to Wardrop and shows NP-hardness of finding optimal taxes for general networks with linear latency functions and two commodities. Expand
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands
TLDR
This work significantly generalizes previous work on how to induce selfish heterogeneous users in a multicommodity network to reach an equilibrium that minimizes the social cost and allows user demands to be elastic. Expand
...
1
2
3
4
5
...