Computer networks have become a critical infrastructure. In fact, networks should not only
meet strict requirements in terms of correctness, availability, and performance but they …

We study consistent migration of flows, with special focus on software defined networks.
Given a current and a desired network flow configuration, we give the first polynomial-time …

In the literature on game-theoretic equilibrium finding, focus has mainly been on solving a
single game in isolation. In practice, however, strategic interactions--ranging from routing …

We study Nash equilibria in the context of flows over time. Many results on static routing
games have been obtained over the last ten years. In flows over time (also called dynamic …

Dynamic network flows, or network flows over time, constitute an important model for real-
world situations where steady states are unusual, such as urban traffic and the Internet …

The general expectation is that the traffic in the cities will be almost optimal when the
collective behaviour of autonomous vehicles will determine the traffic. Each member of the …

Routing games are studied to understand the impact of individual users' decisions on
network efficiency. Most prior work on efficiency in routing games uses a simplified model …

We consider a dynamic model of traffic that has received a lot of attention in the past few
years. Infinitesimally small agents aim to travel from a source to a destination as quickly as …

Abstract Game Theory and Mechanism Design are by now standard tools for studying and
designing massive decentralized systems. Unfortunately, designing mechanisms that induce …

We propose a model of discrete time dynamic congestion games with atomic players and a
single source-destination pair. The latencies of edges are composed of free-flow transit …