Selfish Routing with Incomplete Information

Martin Gairing, Burkhard Monien, Karsten Tiemann

Faculty of CS, EE and Math,
University of Paderborn


In his seminal work Harsanyi [Har67] introduced an elegant approach to study non-cooperative games with incomplete information where the players are uncertain about some parameters. To model such games he introduced the Harsanyi transformation, which converts a game with incomplete information to a strategic game where players may have different types. In the resulting Bayesian game players' uncertainty about each others types is described by a probability distribution over all possible type profiles. In this work, we introduce a particular selfish routing game with incomplete information that we call Bayesian routing game. Here, n selfish users wish to assign their traffic to one of m links. Users do not know each others traffic. Following Harsanyi's approach, we introduce for each user a set of possible types. This paper presents a comprehensive collection of results for the Bayesian routing game. To the best of our knowledge this is the first time that mixed Bayesian Nash equilibria have been studied in conjunction with social cost.