10 search results - page 1 / 2 » Efficient Algorithms to Solve Bayesian Stackelberg Games for... |
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...
ATAL
2008
Springer
13 years 6 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...
ATAL
2011
Springer
12 years 4 months ago
2011
Springer
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
ATAL
2011
Springer
12 years 4 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
ATAL
2008
Springer
13 years 6 months ago
2008
Springer
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...