Routing Games

Beschreibung

Selfish Routing deals with egoistic users optimizing their personal objective while driving through a network. This thesis studies dynamic games, where players allocate resources with load dependent travel times only while they really traverse them. Furthermore, robust games with uncertain data for the players are investigated. For all models central algorithmic questions such as determining optimal solutions and Nash equilibria are tackled for different objectives.

Autor*in

Thomas Werth

Stimmen zu »Routing Games«

Details

Link teilen