80 search results - page 9 / 16 » Existence of Nash Equilibria in Selfish Routing Problems |
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Game theory is emerging as a popular tool for distributed control of multiagent systems. In order to take advantage of these game theoretic tools the interactions of the autonomous...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
SCHEDULING
2008
13 years 7 months ago
2008
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced,...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...