A classic optimization problem in network routing is to minimize C+ D, where C is the
maximum edge congestion and D is the maximum path length (also known as dilation). The …

Data center networks typically have many paths connecting each host pair to achieve high
bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection …

A topology is efficient for network games if, for any game over it, every Nash equilibrium is
socially optimal. It is well known that many topologies are not efficient for network games …

We give several new upper and lower bounds on the worst-case severity of Braess's
paradox and the price of anarchy of selfish routing with respect to the maximum latency …

Bottleneck congestion games properly model the properties of many real-world network
routing applications. They are known to possess strong equilibria—a strengthening of Nash …

The issue of selfish routing through a network has received a lot of attention in recent years.
We study an atomic dynamic routing scenario, where players allocate resources with load …

Bottleneck congestion games properly model the properties of many real-world network
routing applications. They are known to possess strong equilibria–a strengthening of Nash …

Many real-world systems possess rich multi-level structures and exhibit complex dynamics.
The source of complexity often relates to the presence of a web of interwoven interactions …

We study the inefficiency of equilibrium outcomes in bottleneck congestion games. These
games model situations in which strategic players compete for a limited number of facilities …

We study the price of anarchy of selfish routing with variable traffic rates and when the path
cost is a nonadditive function of the edge costs. Nonadditive path costs are important, for …