Datenbestand vom 20. August 2019
Tel: 089 / 66060798
Mo - Fr, 9 - 12 Uhr
Fax: 089 / 66060799
aktualisiert am 20. August 2019
978-3-8439-1534-2, Reihe Mathematik
216 Seiten, Dissertation Technische Universität Kaiserslautern (2014), Hardcover, A5
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.