We consider the problem of characterizing user equilibria and optimal solutions for routing in a given network. We extend the known models by considering users oblivious to congestion in the following sense: While in the typical user equilibrium setting the users follow a strategy that minimizes their individual cost by taking into account the (dynamic) congestion due to the current routing pattern, an oblivious user ignores congestion altogether; instead, he or she decides his routing on the basis of cheapest routes on a network without any flow whatsoever. These cheapest routes can be, for example, the shortest paths in the network without any flow. This model tries to capture the fact that a certain percentage of travelers base their rou...
Routing games are studied to understand the impact of individual users' decisions on network efficie...
We analyze the network congestion game with atomic players, asymmetric strategies, and the maximum l...
We consider the problem of Internet switching, where traffic is generated by selfish users. We study...
AbstractWe study the degradation in network performance caused by the selfish behavior of noncoopera...
Oblivious routing is a static algorithm for routing arbitrary user demands with the property that th...
We consider a network of parallel, non-observable queues and analyze the ``price of anarchy'', an in...
International audienceWe consider a network of parallel, non-observable queues and analyze the "pric...
We consider a network of parallel, non-observable queues and analyze the "price of anarchy", an inde...
In large-scale communication networks, like the Internet, it is usually impossible to globally manag...
We examine the following traffic model. There is a network of users who wish to route traffic to th...
We study the influence of information design on routing in the presence of vagaries, following the c...
We study the problem of selfish routing in the pres-ence of incomplete network information. Our mode...
We study the problem of routing traffic through a congested network. We focus on the simplest case o...
This paper examines the behavior of the price of anarchy as a function of the traffic inflow in nona...
In this paper, we study the price of anarchy of traffic rout-ing, under the assumption that users ar...
Routing games are studied to understand the impact of individual users' decisions on network efficie...
We analyze the network congestion game with atomic players, asymmetric strategies, and the maximum l...
We consider the problem of Internet switching, where traffic is generated by selfish users. We study...
AbstractWe study the degradation in network performance caused by the selfish behavior of noncoopera...
Oblivious routing is a static algorithm for routing arbitrary user demands with the property that th...
We consider a network of parallel, non-observable queues and analyze the ``price of anarchy'', an in...
International audienceWe consider a network of parallel, non-observable queues and analyze the "pric...
We consider a network of parallel, non-observable queues and analyze the "price of anarchy", an inde...
In large-scale communication networks, like the Internet, it is usually impossible to globally manag...
We examine the following traffic model. There is a network of users who wish to route traffic to th...
We study the influence of information design on routing in the presence of vagaries, following the c...
We study the problem of selfish routing in the pres-ence of incomplete network information. Our mode...
We study the problem of routing traffic through a congested network. We focus on the simplest case o...
This paper examines the behavior of the price of anarchy as a function of the traffic inflow in nona...
In this paper, we study the price of anarchy of traffic rout-ing, under the assumption that users ar...
Routing games are studied to understand the impact of individual users' decisions on network efficie...
We analyze the network congestion game with atomic players, asymmetric strategies, and the maximum l...
We consider the problem of Internet switching, where traffic is generated by selfish users. We study...