2 citations · 3 across the 2 of their papers we have counts for
1 paper · 1 filter
Julian Nickerl
This work analyzes the minimum tollbooth problem in atomic network congestion games with unsplittable flows. The goal is to place tolls on edges, such that there exists a pure Nash…