81 search results - page 1 / 17 » A Stackelberg Strategy for Routing Flow over Time |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Routing games are used to to understand the impact of individual users’ decisions on network efficiency. Most prior work on routing games uses a simplified model of network fl...
SAGT
2009
Springer
13 years 11 months ago
2009
Springer
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...
MST
2011
12 years 11 months ago
2011
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...
AAAI
2008
13 years 7 months ago
2008
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 adversary/follower) before the advers...
AAAI
2008
13 years 7 months ago
2008
Security at major locations of economic or political importance is a key concern around the world, particularly given the threat of terrorism. Limited security resources prevent f...