The price of anarchy, defined as the ratio of the worst-case objective function value of a
Nash equilibrium of a game and that of an optimal outcome, quantifies the inefficiency of …

Wardrop equilibria are commonly used as a solution concept of network games when
modeling transportation and telecommunication networks with congestion. This concept …

We present a short, geometric proof for the price-of-anarchy results that have recently been
established in a series of papers on selfish routing in multicommodity flow networks and on …

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

Congestion games are a fundamental and widely studied model for selfish allocation
problems like routing and load balancing. An intrinsic property of these games is that players …

We consider a natural, yet challenging variant of the parallel machine scheduling problem in
which each machine imposes a preferential order over the jobs and schedules the jobs …

This paper provides new bounds on the quality of equilibria in finite congestion games with
affine cost functions, specifically for atomic network routing games. It is well known that the …

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 …

The price of anarchy, defined as the ratio of the worst-case objective function value of a
Nash equilibrium of a game and that of an optimal outcome, quantifies the inefficiency of …

In the last decade, there has been much progress in understanding scheduling problems in
which selfish jobs aim to minimize their individual completion time. Most of this work has …