Consider a two-person zero-sum search game between a hider and a searcher. The hider
hides among n discrete locations, and the searcher successively visits individual locations …

We consider a variant of the hide-and-seek game in which a seeker inspects multiple hiding
locations to find multiple items hidden by a hider. Each hiding location has a maximum …

Consider a two-person zero-sum search game between a hider and a searcher. The hider
hides among n discrete locations, and the searcher successively visits individual locations …

We use a model for discrete stochastic search in which one or more objects (“targets”) are to
be found by a search over n locations (“boxes”), where n is infinitely large. Each box has …

In this article, we investigate a generalized two‐player inspection game between an attacker
and a defender who allocates multiple resources across a critical system. Specifically, the …

This paper studies cluster quasi‐consensus problem for a class of unknown nonlinear
multiagent systems (MASs) with directed communication topology. First, a distributed …

A set of n boxes, located on the vertices of a hypergraph G, contain known but different
rewards. A Searcher opens all the boxes in some hyperedge of G with the objective of …

This paper presents a booby trap game played between a defender and an attacker on a
search space, which may be a compact subset of Euclidean space or a network. The …

We consider a two-player zero-sum inspection game, in which a limited number of detectors
are coordinated in an infrastructure system according to a probability distribution to detect …

In this dissertation, we study the applications of game theory in determining protection
strategies for various infrastructures. The game models are played between a defender …