scientific article; zbMATH DE number 7376078
From MaRDI portal
Publication:5002840
DOI10.4230/LIPIcs.ICALP.2018.151zbMath1499.91016arXiv1708.02737MaRDI QIDQ5002840
Marco Scarsini, Riccardo Colini-Baldeschi, Max Klimm
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1708.02737
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
The price of anarchy in routing games as a function of the demand ⋮ Non-atomic one-round walks in congestion games ⋮ The minimum tollbooth problem in atomic network congestion games with unsplittable flows
Cites Work
- Unnamed Item
- Unnamed Item
- A heuristic method for the minimum toll booth problem
- Pigouvian pricing and stochastic evolutionary implementation
- Edge pricing of multicommodity networks for selfish users with elastic demands
- Improving the price of anarchy for selfish routing via coordination mechanisms
- The toll effect on price of anarchy when costs are nonlinear and asymmetric
- How much can taxes help selfish routing?
- Linear tolls suffice: new bounds and algorithms for tolls in single source networks
- Efficiency of Restricted Tolls in Non-atomic Network Routing Games
- Combinatorial Benders Cuts for the Minimum Tollbooth Problem
- Decomposition techniques for the minimum toll revenue problem
- On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users
- Cost-Balancing Tolls for Atomic Network Congestion Games
- Pricing network edges for heterogeneous selfish users
- The Robustness of Marginal-Cost Taxes in Affine Congestion Games
- Computing network tolls with support constraints
- Evolutionary Implementation and Congestion Pricing
- Watch and learn: optimizing from revealed preferences feedback
- Taxes for Linear Atomic Congestion Games
This page was built for publication:
