Seminario Interdipartimentale di Algoritmica  

Monday, March 13, 2006, 12:00 noon
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
Burkhard Monien, University of Paderborn

DIS - Department of Computer and System Sciences
Room C3, second floor

Abstract:

In this talk we study (weighted) network congestion games allowing incomplete knowledge about the system. Such Bayesian routing games can be transformed into complete information routing games where the latency functions are player-specific. In a routing game, n selfish players wish to route their traffic through a shared network. In this talk several results on the existence and computational complexity of pure Nash equilibria and on the price of anarchy for splittable and unsplittable traffic for linear latency functions will be presented.