The Complexity of Congestion Games
نویسندگان
چکیده
We investigate issues of complexity related to congestion games. In particular, we provide a full classification of complexity results for the problem of finding a minimum cost solution to a congestion game, under the model of Rosenthal. We consider both network and general congestion games, and we examine several variants of the problem concerning the structure of the game and the properties of its associated cost functions. Many of these problem variants are NP-hard, and some are hard to approximate. We also identify several versions of the problem that are solvable in polynomial time.
منابع مشابه
On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games1
Rosenthal’s congestion games constitute one of the few known classes of noncooperative games possessing purestrategy Nash equilibria. In the network version, each player wants to route one unit of flow on a single path from her origin to her destination at minimum cost, and the cost of using an arc depends only on the total number of players using that arc. A natural extension is to allow for p...
متن کاملComputing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria – a strengthening of Nash equilibrium to resilience against coalitional deviations. In this paper, we study the computational complexity of pure Nash and strong equilibria in these games. We provide a generic centralized algorithm to compute stro...
متن کاملSimulate Congestion Prediction in a Wireless Network Using the LSTM Deep Learning Model
Achieved wireless networks since its beginning the prevalent wide due to the increasing wireless devices represented by smart phones and laptop, and the proliferation of networks coincides with the high speed and ease of use of the Internet and enjoy the delivery of various data such as video clips and games. Here's the show the congestion problem arises and represent aim of the research is t...
متن کاملThe Complexity of Pure Nash Equilibria in Weighted Max-Congestion Games
We study Network Max-Congestion Games (NMC games, for short), a class of network games where each player tries to minimize the most congested edge along the path he uses as strategy. We focus our study on the complexity of computing a pure Nash equilibria in weighted NMC games. We show that, for single-commodity games with non-decreasing delay functions, this problem is in P when either all the...
متن کاملCOMS E 6998 : Algorithmic Game Theory and Economics Jan 27 , 2011 Lecture 2 – Congestion Games
Last week we looked at a global network connection game, and used the potential function method to show the existence of a global potential function and a pure equilibrium for that game. This week we will broaden our focus to the generalization of this game, which is the category of the Congestion Games. These games are of interest because they model many network, routing and resource allocatio...
متن کامل