#### Filter Results:

- Full text PDF available (35)

#### Publication Year

2008

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Many search and security games played on a graph can be modeled as normal-form zero-sum games with strategies consisting of sequences of actions. The size of the strategy space provides a computational challenge when solving these games. This complexity is tackled either by using the compact representation of sequential strategies and linear programming ,… (More)

We study the problem of optimal resource allocation for packet selection and inspection to detect potential threats in large computer networks with multiple computers of differing importance. An attacker tries to harm these targets by sending malicious packets from multiple entry points of the network; the defender thus needs to optimally allocate her… (More)

- Ondrej Vanek, Branislav Bosanský, Michal Jakob, Michal Pechoucek
- Proceedings of the 2010 IEEE Conference on…
- 2010

We study the problem of a mobile agent trying to cross an area patrolled by a mobile adversary. The transiting agent aims to choose its route so as to minimize the probability of hostile encounter; the patroller agent, controlling one or more patrol units, aims at the opposite. We model the problem as a two-player zero-sum game (termed transit game) and… (More)

- Ondrej Vanek, Branislav Bosanský, Michal Jakob, Viliam Lisý, Michal Pechoucek
- AAAI Spring Symposium: Game Theory for Security…
- 2012

A number of real-world security scenarios can be cast as a problem of transiting an area guarded by a mobile patroller, where the transiting agent aims to choose its route so as to minimize the probability of encountering the patrolling agent, and vice versa. We model this problem as a two-player zero-sum game on a graph, termed the transit game. In… (More)

- Branislav Bosanský, Christopher Kiekintveld, Viliam Lisý, Michal Pechoucek
- J. Artif. Intell. Res.
- 2014

Developing scalable solution algorithms is one of the central problems in computational game theory. We present an iterative algorithm for computing an exact Nash equilibrium for two-player zero-sum extensive-form games with imperfect information. Our approach combines two key elements: (1) the compact sequence-form representation of extensive-form games… (More)

- Branislav Bosanský, Viliam Lisý, Marc Lanctot, Jiri Cermak, Mark H. M. Winands
- Artif. Intell.
- 2016

- Branislav Bosanský, Viliam Lisý, Michal Jakob, Michal Pechoucek
- AAMAS
- 2011

We study how a mobile defender should patrol an area to protect multiple valuable targets from being attacked by an attacker. In contrast to existing approaches, which assume stationary targets, we allow the targets to move through the area according to an a priori known, deterministic movement schedules. We represent the patrol area by a graph of arbitrary… (More)

A number of real-world security scenarios can be cast as a problem of transiting an area patrolled by a mobile adversary , where the transiting agent aims to choose its route so as to minimize the probability of encountering the patrolling agent, and vice versa. We model this problem as a two-player zero-sum game on a graph, termed the transit game. In… (More)

A honeypot is a decoy computer system used in network security to waste the time and resources of attackers and to analyze their behaviors. While there has been significant research on how to design honeypot systems, less is known about how to use honeypots strategically in network defense. Based on formal deception games, we develop two game-theoretic… (More)

We investigate an iterative algorithm for computing an exact Nash equilibrium in two-player zero-sum extensive-form games with imperfect information. The approach uses the sequence-form representation of extensive-form games and the double-oracle algo-rithmic framework. The main idea is to restrict the game by allowing the players to play only some of the… (More)