Refine
Document Type
- ZIB-Report (11)
- In Proceedings (6)
- Article (5)
Language
- English (22)
Is part of the Bibliography
- no (22)
Keywords
- Game Theory (2)
- Integer Programming (2)
- Mixed Integer Programming (2)
- Netzwerkaggregation (2)
- Stackelberg Equilibrium (2)
- Vehicle Routing Problem (2)
- network aggregation (2)
- Controls in transportation networks (1)
- Duty Roster Planning (1)
- Duty Rostering (1)
- Fallstudie (1)
- Operations Research (1)
- Polymatrix game (1)
- Price of Anarchy (1)
- Security Games (1)
- Simplon Korridor (1)
- Simplon corridor (1)
- Stackelberg game (1)
- Toll Enforcement (1)
- Trassenallokation (1)
- bicriteria optimization (1)
- case study (1)
- crew rostering (1)
- integer programming (1)
- macroscopic railway modeling (1)
- makroskopische Bahnmodellierung (1)
- railway models, railway capacity, track allocation framework (1)
- railway track allocation (1)
- vehicle routing (1)
Institute
We present a game-theoretic approach to optimize the strategies of toll enforcement on a motorway network. In contrast to previous approaches, we consider a network with an arbitrary topology, and we handle the fact that users may choose their Origin-Destination path; in particular they may take a detour to avoid sections with a high control rate. We show that a Nash equilibrium can be computed with an LP (although the game is not zero-sum), and we give a MIP for the computation of a Stackelberg equilibrium. Experimental results based on an application to the enforcement of a truck toll on German motorways are presented.