Sciweavers

177 search results - page 1 / 36
» Stackelberg Routing in Arbitrary Networks
Sort
View
MOR
2010
58views more  MOR 2010»
13 years 6 months ago
Stackelberg Routing in Arbitrary Networks
Vincenzo Bonifaci, Tobias Harks, Guido Schäfe...
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 6 months ago
A Stackelberg Strategy for Routing Flow over Time
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...
Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
MST
2011
184views Hardware» more  MST 2011»
13 years 2 months ago
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
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...
Tobias Harks
WINE
2005
Springer
161views Economy» more  WINE 2005»
14 years 1 months ago
Design of Incentive Compatible Mechanisms for Stackelberg Problems
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
Dinesh Garg, Yadati Narahari
AAAI
2010
13 years 9 months ago
Security Games with Arbitrary Schedules: A Branch and Price Approach
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
Manish Jain, Erim Kardes, Christopher Kiekintveld,...