中文
相关论文

相关论文: Covert Vehicle Misguidance and Its Detection: A Hy…

200 篇论文

We study a two-player, zero-sum, dynamic game with incomplete information where one of the players is more informed than his opponent. We analyze the limit value as the players play more and more frequently. The more informed player…

最优化与控制 · 数学 2015-09-14 Fabien Gensbittel

We introduce a game-theoretic framework to study the hypothesis testing problem, in the presence of an adversary aiming at preventing a correct decision. Specifically, the paper considers a scenario in which an analyst has to decide whether…

信息论 · 计算机科学 2013-04-09 Mauro Barni , Benedetta Tondi

We consider a scenario where a team of two unmanned aerial vehicles (UAVs) pursue an evader UAV within an urban environment. Each agent has a limited view of their environment where buildings can occlude their field-of-view. Additionally,…

多智能体系统 · 计算机科学 2025-11-13 Addison Kalanther , Daniel Bostwick , Chinmay Maheshwari , Shankar Sastry

Conventional language model (LM) safety alignment relies on a reactive, disjoint procedure: attackers exploit a static model, followed by defensive fine-tuning to patch exposed vulnerabilities. This sequential approach creates a mismatch --…

机器学习 · 计算机科学 2025-10-07 Mickel Liu , Liwei Jiang , Yancheng Liang , Simon Shaolei Du , Yejin Choi , Tim Althoff , Natasha Jaques

This paper considers a game-theoretic formulation of the covert communications problem with finite blocklength, where the transmitter (Alice) can randomly vary her transmit power in different blocks, while the warden (Willie) can randomly…

信息论 · 计算机科学 2020-05-28 Alex S. Leong , Daniel E. Quevedo , Subhrakanti Dey

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 until finding the hider. Known to both players, a search at…

最优化与控制 · 数学 2023-05-18 Jake Clarkson , Kyle Y Lin

We study a class of semi-discrete variational problems that arise in economic matching and game theory, where agents with continuous attributes are matched to a finite set of outcomes with a one dimensional structure. Such problems appear…

最优化与控制 · 数学 2025-08-14 Omar Abdul Halim , Daniyar Omarov , Brendan Pass

This paper investigates the two-person zero-sum stochastic games for piece-wise deterministic Markov decision processes with risk-sensitive finite-horizon cost criterion on a general state space. Here, the transition and cost/reward rates…

最优化与控制 · 数学 2024-05-15 Subrata Golui

Most conventional heterogeneous network selection strategies applied in heterogeneous vehicular network regard the performance of each network constant in various traffic scenarios. This assumption leads such strategies to be ineffective in…

网络与互联网体系结构 · 计算机科学 2019-05-28 Xiangmo Zhao , Xiaochi Li , Zhigang Xu , Ting Chen

We consider the Reinforcement Learning problem of controlling an unknown dynamical system to maximise the long-term average reward along a single trajectory. Most of the literature considers system interactions that occur in discrete time…

人工智能 · 计算机科学 2023-09-07 Lorenzo Croissant , Marc Abeille , Bruno Bouchard

Selective classification is a powerful tool for automated decision-making in high-risk scenarios, allowing classifiers to act only when confident and abstain when uncertainty is high. Given a target accuracy, our goal is to minimize…

统计理论 · 数学 2025-10-28 Mohamed Ndaoud , Peter Radchenko , Bradley Rava

We study deception in adversarial graph traversal, where a mobile agent seeks to reach a goal with minimum cost while an adversary alters edge costs to increase the total traversal cost. Unlike prior works that assume fixed…

系统与控制 · 电气工程与系统科学 2026-05-25 Violetta Rostobaya , James Berneburg , Daigo Shishika

Many security and other real-world situations are dynamic in nature and can be modelled as strictly competitive (or zero-sum) dynamic games. In these domains, agents perform actions to affect the environment and receive observations --…

计算机科学与博弈论 · 计算机科学 2020-10-23 Karel Horák , Branislav Bošanský , Vojtěch Kovařík , Christopher Kiekintveld

Maximising the detection of intrusions is a fundamental and often critical aim of perimeter surveillance. Commonly, this requires a decision-maker to optimally allocate multiple searchers to segments of the perimeter. We consider a scenario…

机器学习 · 计算机科学 2019-11-12 James A. Grant , David S. Leslie , Kevin Glazebrook , Roberto Szechtman , Adam N. Letchford

Robots deployed to the real world must be able to interact with other agents in their environment. Dynamic game theory provides a powerful mathematical framework for modeling scenarios in which agents have individual objectives and…

Path planning plays an essential role in many areas of robotics. Various planning techniques have been presented, either focusing on learning a specific task from demonstrations or retrieving trajectories by optimizing for hand-crafted cost…

机器人学 · 计算机科学 2018-09-26 Salvatore Virga , Christian Rupprecht , Nassir Navab , Christoph Hennersperger

A framework is presented for handling a potential loss of observability of a dynamical system in a provably-safe way. Inspired by the fragility of data-driven perception systems used by autonomous vehicles, we formulate the problem that…

系统与控制 · 电气工程与系统科学 2020-05-19 Forrest Laine , Chiu-Yuan Chiu , Claire Tomlin

We consider a Markov decision process (MDP) in which actions prescribed by the controller are executed by a separate actuator, which may behave adversarially. At each time step, the controller selects and transmits an action to the…

信息论 · 计算机科学 2025-01-29 Edoardo David Santi , Gongpu Chen , Deniz Gündüz , Asaf Cohen

An operational relevant conflict between teams of autonomous vehicles in the Beyond Visual Range domain is addressed in this paper. Optimal strategies are designed in order for a team of air interceptors to protect a high value asset and…

最优化与控制 · 数学 2020-09-23 Eloy Garcia , David W. Casbeer , Dzung Tran , Meir Pachter

We study the value of a two-player zero-sum game on a random matrix $M\in \mathbb{R}^{n\times m}$, defined by $v(M) = \min_{x\in\Delta_n}\max_{y\in \Delta_m}x^T M y$. In the setting where $n=m$ and $M$ has i.i.d. standard Gaussian entries,…

概率论 · 数学 2026-01-13 Romain Cosson , Laurent Massoulié