Search
Now showing items 111-112 of 112
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 ...
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 ...