Sciweavers

794 search results - page 1 / 159
» Stackelberg scheduling strategies
Sort
View
STOC
2001
ACM
109views Algorithms» more  STOC 2001»
14 years 5 months ago
Stackelberg scheduling strategies
Tim Roughgarden
AAAI
2008
13 years 7 months ago
Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications
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...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
ATAL
2008
Springer
13 years 6 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
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...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
13 years 11 months ago
Learning and Approximating the Optimal Strategy to Commit To
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...
Joshua Letchford, Vincent Conitzer, Kamesh Munagal...
AAAI
2012
11 years 7 months ago
Computing Optimal Strategies to Commit to in Stochastic Games
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
Joshua Letchford, Liam MacDermed, Vincent Conitzer...