We consider a strategic network monitoring problem involving the operator of a networked
system and an attacker. The operator aims to randomize the placement of multiple protected …

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 investigate the interplay between forward uncertain difference equations and backward
stochastic difference equations, which belong to distinct mathematical frameworks …

This article studies a problem of strategic network inspection, in which a defender (agency)
is tasked with detecting the presence of multiple attacks in the network. An inspection …

Suppose a target is hidden in one of the vertices of an edge-weighted graph according to a
known probability distribution. Starting from a fixed root node, an expanding search visits the …

An uncertain stochastic noncausal system (USNS) is an uncertain stochastic singular system
that is expected to be regular but not impulse-free. This study investigates zero-sum games …

We consider a two-person network inspection game, in which a defender positions a limited
number of detectors to detect multiple attacks caused by an attacker. We assume that …

In this paper, we study the following robust optimization problem. Given an independence
system and candidate objective functions, we choose an independent set, and then an …