Sciweavers

128 search results - page 6 / 26
» Computing optimal strategies to commit to in extensive-form ...
Sort
View
CONCUR
2005
Springer
14 years 2 months ago
Games Where You Can Play Optimally Without Any Memory
Abstract. Reactive systems are often modelled as two person antagonistic games where one player represents the system while his adversary represents the environment. Undoubtedly, t...
Hugo Gimbert, Wieslaw Zielonka
ICRA
2010
IEEE
215views Robotics» more  ICRA 2010»
13 years 7 months ago
Moving game theoretical patrolling strategies from theory to practice: An USARSim simulation
— Game theoretical approaches have been recently used to develop patrolling strategies for mobile robots. The idea is that the patroller and the intruder play a game, whose outco...
Francesco Amigoni, Nicola Basilico, Nicola Gatti, ...
ICALP
2007
Springer
14 years 2 months ago
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
ATAL
2010
Springer
13 years 9 months ago
Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
Zhengyu Yin, Dmytro Korzhyk, Christopher Kiekintve...
JAIR
2011
214views more  JAIR 2011»
12 years 11 months ago
Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...
Dmytro Korzhyk, Zhengyu Yin, Christopher Kiekintve...