Related papers: Optimal fire allocation in a combat model of mixed…
In this paper, we introduce a non-linear Lanchester model of NCW-type and investigate an optimization problem for this model, where only the Red force is supplied by several supply agents. Optimal fire allocation of the Blue force is sought…
In this paper, a non-linear Lanchester-type model involving supply units is introduced. The model describes a battle where the Blue party consisting of one armed force $B$ is fighting against the Red party. The Red party consists of $n$…
In this paper is presented a framework for treating uncertainty in optimal decision problems occuring in combat situations, in order to robustly select the optimal strategy. A stochastic version of the popular Lanchester's aimed-fire model…
We study a class of optimal allocation problems, including the well-known Bomber Problem, with the following common probabilistic structure. An aircraft equipped with an amount~$x$ of ammunition is intercepted by enemy airplanes arriving…
The outcomes of warfare have rarely only been characterised by the quantity and quality of individual combatant force elements. The ability to manoeuvre and adapt across force elements through effective Command and Control (C2) can allow…
We consider a model of adversarial dynamics consisting of three populations, labelled Blue, Green and Red, which evolve under a system of first order nonlinear differential equations. Red and Blue populations are adversaries and interact…
In the Firefighter problem, introduced by Hartnell in 1995, a fire spreads through a graph while a player chooses which vertices to protect in order to contain it. In this paper, we focus on the case of trees and we consider as well the…
Resource allocation is the process of optimizing the rare resources. In the area of security, how to allocate limited resources to protect a massive number of targets is especially challenging. This paper addresses this resource allocation…
The Fighter problem with discrete ammunition is studied. An aircraft (fighter) equipped with $n$ anti-aircraft missiles is intercepted by enemy airplanes, the appearance of which follows a homogeneous Poisson process with known intensity.…
In this paper, we investigate optimal resource allocation in a power beacon-assisted wireless-powered communication network (PB-WPCN), which consists of a set of hybrid access point (AP)-source pairs and a power beacon (PB). Each source,…
The dynamic problem of enclosing an expanding fire can be modelled by a discrete variant in a grid graph. While the fire expands to all neighbouring cells in any time step, the fire fighter is allowed to block $c$ cells in the average…
We present a mathematical model for optimizing breakaway strategies in competitive cycling, balancing power expenditure, aerodynamic drag, and crashing. Our framework incorporates probabilistic crash dynamics, allowing a cyclist's risk…
This letter proposes an energy efficient distributed worst case robust power allocation in massive multiple input multiple output (MIMO) system. We assume a bounded channel state information (CSI) error and all channels lie in some bounded…
We study the problem of model selection in batch policy optimization: given a fixed, partial-feedback dataset and $M$ model classes, learn a policy with performance that is competitive with the policy derived from the best model class. We…
The paper studies a dynamic blocking problem, motivated by a model of optimal fire confinement. While the fire can expand with unit speed in all directions, barriers are constructed in real time. An optimal strategy is sought, minimizing…
Continuous and discrete models for firefighting problems are well-studied in Theoretical Computer Science. We introduce a new, discrete, and more general framework based on a hexagonal cell graph to study firefighting problems in varied…
For multiple emergencies caused by natural disasters, it is crucial to allocate resources equitably to each emergency location, especially when the availability of resources is limited in quantity. This paper has developed a multi-event…
Consider a model of fire spreading through a graph; initially some vertices are burning, and at every given time-step fire spreads from burning vertices to their neighbours. The firefighter problem is a solitaire game in which a player is…
Adversarial optimal transport has been proven useful as a mathematical formulation to model resource allocation problems to maximize the efficiency of transportation with an adversary, who modifies the data. It is often the case, however,…
This paper focuses on the issue of energy efficiency in wireless data networks through a game theoretic approach. The case considered is that in which each user is allowed to vary its transmit power, spreading code, and uplink receiver in…