81 search results - page 2 / 17 » A Stackelberg Strategy for Routing Flow over Time |
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
SAGT
2009
Springer
13 years 11 months ago
2009
Springer
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—We study the resilience of MPLS flows over an agile all-photonic star WDM network (AAPN). On the basis of our previous inter-area optimal routing architecture, we propose and de...
IAT
2007
IEEE
13 years 11 months ago
2007
IEEE
Today’s air traffic management system is not expected to scale to the projected increase in traffic over the next two decades. Enhanced collaboration between the controllers and...
WINE
2009
Springer
13 years 12 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 ...