相关论文: Guarding a Target Set from a Single Attacker in th…

Motivated by the stringent safety requirements that are often present in real-world applications, we study a safe online convex optimization setting where the player needs to simultaneously achieve sublinear regret and zero constraint…

This paper investigates the encirclement control problem involving two groups using a non-cooperative differential game approach. The active group seeks to chase and encircle the passive group, while the passive group responds by fleeing…

This paper considers the blocking or football pursuit-evasion differential game. Two pursuers cooperate and try to capture the ball carrying evader as far as possible from the goal line. The evader wishes to be as close as possible to the…

Given a finite set $S$ of points in $\mathbb{R}^d$, which we regard as the locations of voters on a $d$-dimensional political `spectrum', two candidates (Alice and Bob) select one point in $\mathbb{R}^d$ each, in an attempt to get as many…

Several problems in planning and reactive synthesis can be reduced to the analysis of two-player quantitative graph games. {\em Optimization} is one form of analysis. We argue that in many cases it may be better to replace the optimization…

The increasing prevalence of security attacks on software-intensive systems calls for new, effective methods for detecting and responding to these attacks. As one promising approach, game theory provides analytical tools for modeling the…

We consider a search problem in which one or more targets must be rescued by a search party, or Searcher. The targets may be survivors of some natural disaster, or prisoners held by an adversary. The targets are hidden among a finite set of…

Reach-avoid (RA) games have significant applications in security and defense, particularly for unmanned aerial vehicles (UAVs). These problems are inherently challenging due to the need to consider obstacles, consider the adversarial nature…

We study the problem of characterizing the set of games that are consistent with observed equilibrium play. Our contribution is to develop and analyze a new methodology based on convex optimization to address this problem for many classes…

This research addresses the increasing demand for advanced navigation systems capable of operating within confined surroundings. A significant challenge in this field is developing an efficient planning framework that can generalize across…

We study the parameterized complexity of interdiction problems in graphs. For an optimization problem on graphs, one can formulate an interdiction problem as a game consisting of two players, namely, an interdictor and an evader, who…

Recently, Adiprasito et al. have initiated the study of the so-called no-dimensional Tverberg problem. This problem can be informally stated as follows: Given $n\geq k$, partition an $n$-point set in Euclidean space into $k$ parts such that…

This paper proposes a game-theoretic approach to address the problem of optimal sensor placement for detecting cyber-attacks in networked control systems. The problem is formulated as a zero-sum game with two players, namely a malicious…

Bilevel optimization problems involve two nested objectives, where an upper-level objective depends on a solution to a lower-level problem. When the latter is non-convex, multiple critical points may be present, leading to an ambiguous…

In this paper, we study two classic optimization problems: minimum geometric dominating set and set cover. In the dominating-set problem, for a given set of objects in {the} plane as input, the objective is to choose a minimum number of…

This paper presents a novel method for reformulating non-differentiable collision avoidance constraints into smooth nonlinear constraints using strong duality of convex optimization. We focus on a controlled object whose goal is to avoid…

Effective game-theoretic modeling of defender-attacker behavior is becoming increasingly important. In many domains, the defender functions not only as a player but also the designer of the game's payoff structure. We study Stackelberg…

We present a novel two-player game in a chaotic dynamical system where players have opposing objectives regarding the system's behavior. The game is analyzed using a methodology from the field of chaos control known as partial control. Our…

The Euclidean projection onto a convex set is an important problem that arises in numerous constrained optimization tasks. Unfortunately, in many cases, computing projections is computationally demanding. In this work, we focus on…

In this work we consider the problem of finding the minimum-weight loop cover of an undirected graph. This combinatorial optimization problem is called 2-matching and can be seen as a relaxation of the traveling salesman problem since one…