Browsing by Subject "Nash equilibria"
Now showing items 21-26 of 26
-
Article
The price of selfish routing
(2007)We study the problem of routing traffic through a congested network. We focus on the simplest case of a network consisting of m parallel links. We assume a collection of n network users
-
Article
The structure and complexity of Nash equilibria for a selfish routing game
(2009)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 parallel links. We assume a collection ...
-
Article
The structure and complexity of Nash equilibria for a selfish routing game
(2002)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 parallel links. We assume a collection ...
-
Article
Weighted boolean formula games
(2007)We introduce a new class of succinct games, called weighted boolean formula games. Here, each player has a set of boolean formulas he wants to get satisfied. The boolean formulas of all players involve a ground set of ...
-
Article
Which is the worst-case Nash equilibrium?
(2003)A Nash equilibrium of a routing network represents a stable state of the network where no user finds it beneficial to unilaterally deviate from its routing strategy. In this work, we investigate the structure of such ...
-
Conference Object
∃ℝ-complete decision problems about symmetric nash equilibria in symmetric multi-player games
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)We study the complexity of decision problems about symmetric Nash equilibria for symmetric multi-player games. These decision problems concern the existence of a symmetric Nash equilibrium with certain natural properties. ...