80 search results - page 1 / 16 » Existence of Nash Equilibria in Selfish Routing Problems |
SIROCCO
2004
13 years 6 months ago
2004
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...
PE
2002
Springer
13 years 4 months ago
2002
Springer
The paper studies routing in loss networks in the framework of a non-cooperative game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
ESA
2007
Springer
13 years 8 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
ICS
2010
Tsinghua U.
14 years 1 months ago
2010
Tsinghua U.
: We revisit price of anarchy in network routing, in a new model in which routing decisions are made by self-interested components of the network, as opposed to by the flows as in ...