Cloud computing has emerged as a popular computing paradigm for hosting large
computing systems and services. Recently, significant research is carried out on Resource …

An analysis of the loss in performance caused by selfish, uncoordinated behavior in
networks. Most of us prefer to commute by the shortest route available, without taking into …

We investigate from the computational viewpoint multi-player games that are guaranteed to
have pure Nash equilibria. We focus on congestion games, and show that a pure Nash …

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

We develop polynomial-time algorithms for finding correlated equilibria—a well-studied
notion of rationality that generalizes the Nash equilibrium—in a broad class of succinctly …

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 paper we investigate complexity issues related to pure Nash equilibria of strategic
games. We show that, even in very restrictive settings, determining whether a game has a …

A strong equilibrium is a pure Nash equilibrium which is resilient to deviations by coalitions.
We define the strong price of anarchy (SPoA) to be the ratio of the worst strong equilibrium to …

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 study a basic network creation game proposed by Fabrikant et al.[2003]. In this game,
each player (vertex) can create links (edges) to other players at a cost of α per edge. The …