Routing problem with splitable traffic and incomplete information
We investigate the equilibria in Bayesian routing game in network with selfish users behavior where each user chooses his route trying to minimize the expected delay of the traffic he sends. This scheme is based on [1] and modified for model with parallel links where users traffic is splittable. Our interest are equilibria: Wardrop Equilibrium, that always exists and can be found using potential function, and its special case Bayesian Wardrop Equilibrium, that can be more easily understood by users, but its existence is an open question.