1087 search results - page 45 / 218 » Dynamics in congestion games |
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
SIROCCO
2004
13 years 10 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...
ICS
2010
Tsinghua U.
14 years 6 months ago
2010
Tsinghua U.
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
SIGECOM
2011
ACM
12 years 11 months ago
2011
ACM
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
QRE
2010
2010
Improving quality of prediction in highly dynamic environments using approximate dynamic programming
13 years 7 months ago
In many applications, decision making under uncertainty often involves two steps- prediction of a certain quality parameter or indicator of the system under study and the subseque...