Add to ORKGThe paper [4] has established the convergence of the Nash equilibrium in routing games to the Wardrop equilibrium as the number of players grows. The result was obtained under diagonal strict convexity assumption. We extend this result and establish the convergence under weaker convexity assumptions (the B type cost structure of [5]). 1
International audienceWe investigate the convergence of sequential best-response dynamics in a routi...
The asymptotic behaviour of deterministic logit dynamics in heterogeneous routing games is analyzed...
Congestion games have extensively been studied till recently. It is shown by Fotakis (2010) that for...
We consider the question of whether and in what sense, Wardrop equilibria provide a good approximati...
There has been substantial work developing simple, efficient no-regret algorithms for a wide class o...
There has been substantial work developing simple, efficient no-regret algorithms for a wide class o...
In a discrete routing game, each of n selfish users employs a mixed strategy to ship its (unsplittab...
International audienceWe focus on the problem of learning equilibria in a particular routing game si...
In this paper we investigate the splittable routing game in a series-parallel network with two selfi...
International audienceWe consider an instance of a nonatomic routing game. We assume that the networ...
The classical Wardropian principle assumes that users minimize either individual travel cost or over...
The classical Wardropian principle assumes that users minimize either individual travel cost or over...
AbstractIn a discrete routing game, each of n selfish users employs a mixed strategy to ship her (un...
The price of anarchy has become a standard measure of the efficiency of equilibria in games. Most of...
In this paper we investigate the splittable routing game in a series-parallel network with two self...
International audienceWe investigate the convergence of sequential best-response dynamics in a routi...
The asymptotic behaviour of deterministic logit dynamics in heterogeneous routing games is analyzed...
Congestion games have extensively been studied till recently. It is shown by Fotakis (2010) that for...
We consider the question of whether and in what sense, Wardrop equilibria provide a good approximati...
There has been substantial work developing simple, efficient no-regret algorithms for a wide class o...
There has been substantial work developing simple, efficient no-regret algorithms for a wide class o...
In a discrete routing game, each of n selfish users employs a mixed strategy to ship its (unsplittab...
International audienceWe focus on the problem of learning equilibria in a particular routing game si...
In this paper we investigate the splittable routing game in a series-parallel network with two selfi...
International audienceWe consider an instance of a nonatomic routing game. We assume that the networ...
The classical Wardropian principle assumes that users minimize either individual travel cost or over...
The classical Wardropian principle assumes that users minimize either individual travel cost or over...
AbstractIn a discrete routing game, each of n selfish users employs a mixed strategy to ship her (un...
The price of anarchy has become a standard measure of the efficiency of equilibria in games. Most of...
In this paper we investigate the splittable routing game in a series-parallel network with two self...
International audienceWe investigate the convergence of sequential best-response dynamics in a routi...
The asymptotic behaviour of deterministic logit dynamics in heterogeneous routing games is analyzed...
Congestion games have extensively been studied till recently. It is shown by Fotakis (2010) that for...