In a system where noncooperative agents share a common resource, we propose the price
of anarchy, which is the ratio between the worst possible Nash equilibrium and the social …

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 …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

We consider the price of anarchy of pure Nash equilibria in congestion games with linear
latency functions. For asymmetric games, the price of anarchy of maximum social cost is Θ …

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 …

We study the problem of optimizing the performance of a system shared by selfish,
noncooperative users. We consider the concrete setting of scheduling jobs on a set of …

We study the problem of traffic routing in noncooperative networks. In such networks, users
may follow selfish strategies to optimize their own performance measure and therefore, their …

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 …

What is the price of anarchy when unsplittable demands are routed selfishly in general
networks with load-dependent edge delays? Motivated by this question we generalize the …

We propose weakening the assumption made when studying the price of anarchy: Rather
than assume that self-interested players will play according to a Nash equilibrium (which …