Sciweavers

42 search results - page 4 / 9
» Uncertainties in adversarial patrol
Sort
View
ATAL
2008
Springer
13 years 9 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...
SIAMCO
2002
124views more  SIAMCO 2002»
13 years 7 months ago
On Reachability Under Uncertainty
The paper studies the problem of reachability for linear systems in the presence of uncertain input disturbances that may also be interpreted as the action of an adversary in a ga...
Alexander B. Kurzhanski, Pravin Varaiya
COLT
2008
Springer
13 years 9 months ago
Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs
Prediction from expert advice is a fundamental problem in machine learning. A major pillar of the field is the existence of learning algorithms whose average loss approaches that ...
Elad Hazan, Satyen Kale
ATAL
2009
Springer
14 years 2 months ago
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
James Pita, Manish Jain, Fernando Ordó&ntil...
SIAMCOMP
2008
154views more  SIAMCOMP 2008»
13 years 5 months ago
Cryptography in the Bounded-Quantum-Storage Model
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size. We show that oblivio...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...