Computer science and economics have engaged in a lively interaction over the past fifteen
years, resulting in the new field of algorithmic game theory. Many problems that are central …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

The essence of the routing problem in real networks is that the traffic demand from a source
to destination must be satisfied by choosing a single path between source and destination …

Abstract The Multiplicative Weights Update (MWU) method is a ubiquitous meta-algorithm
that works as follows: A distribution is maintained on a certain set, and at each step the …

We introduce the concept of a sink equilibrium. A sink equilibrium is a strongly connected
component with no outgoing arcs in the strategy profile graph associated with a game. The …

In this work, we study the combinatorial structure and the computational complexity of Nash
equilibria for a certain game that models selfish routing over a network consisting of m …

This chapter studies the inefficiency of equilibria in noncooperative routing games, in which
selfinterested players route traffic through a congested network. Our goals are threefold: to …

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 …

The network function virtualization (NFV) paradigm has gained increasing interest in both
academia and industry as it promises scalable and flexible network management and …

In the traffic assignment problem, first proposed by Wardrop in 1952, commuters select the
shortest available path to travel from their origins to their destinations. We study a …