The minimum tollbooth problem in atomic network congestion games with unsplittable flows

DOI10.1007/s00224-021-10038-9zbMath1471.91020arXiv1906.09865OpenAlexW3148603050MaRDI QIDQ2230724

Julian Nickerl

Publication date: 28 September 2021

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.09865

zbMATH Keywords

series-parallel graphunsplittable flowsocial optimumatomic network congestion gamesminimum tollbooth problemweighted CNF SAT

Mathematics Subject Classification ID

Games involving graphs (91A43) Games with infinitely many players (91A07) Potential and congestion games (91A14)

Related Items (1)

Inefficiency of pure Nash equilibria in series-parallel network congestion games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimization of traffic congestion in road networks with tolls
• A heuristic method for the minimum toll booth problem
• How much can taxes help selfish routing?
• A class of games possessing pure-strategy Nash equilibria
• Efficiency of Restricted Tolls in Non-atomic Network Routing Games
• The Impact of Oligopolistic Competition in Networks
• Combinatorial Benders Cuts for the Minimum Tollbooth Problem
• On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users
• How bad is selfish routing?
• New Complexity Results and Algorithms for the Minimum Tollbooth Problem
• Cost-Balancing Tolls for Atomic Network Congestion Games
• Pricing network edges for heterogeneous selfish users
• The price of anarchy of finite congestion games
• Computing network tolls with support constraints
• Taxes for Linear Atomic Congestion Games
• Parameterized Algorithms

This page was built for publication: The minimum tollbooth problem in atomic network congestion games with unsplittable flows