相关论文: A Booby Trap Game

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…

In this article we discuss network growth based on Prisoner's Dilemma(PD) where palyers on nodes in a network palay with its linked players. The players estimate total profits in the PD. When a new node is attached, the node make linkes to…

We study a binary hypothesis testing problem in which a defender must decide whether or not a test sequence has been drawn from a given memoryless source $P_0$ whereas, an attacker strives to impede the correct detection. With respect to…

We study online fair division when there are a finite number of item types and the player values for the items are drawn randomly from distributions with unknown means. In this setting, a sequence of indivisible items arrives according to a…

In this article an $n$-pursuer versus $m$-evader reach-avoid differential game in 3D space is studied. A team of evaders aim to reach a stationary target while avoiding capture by a team of pursuers. The multiplayer scenario is formulated…

We study a generalized binary search problem on the line and general trees. On the line (e.g., a sorted array), binary search finds a target node in $O(\log n)$ queries in the worst case, where $n$ is the number of nodes. In situations with…

We study biased Maker-Breaker games on a graph system $\{G_1,\ldots,G_s\}$, in which Maker's goal is to claim certain rainbow structures, i.e., specified subgraphs consisting of at most one edge from each graph $G_i$. We consider the…

In this paper we investigate the problem of designing a spectrum scanning strategy to detect an intelligent Invader who wants to utilize spectrum undetected for his/her unapproved purposes. To deal with this problem we apply…

This work introduces the dynamic Defender-Attacker Blotto (dDAB) game, extending the classical static Blotto game to a dynamic resource allocation setting over graphs. In the dDAB game, a defender is required to maintain numerical…

We study computability-theoretic aspects of differential games. Our focus is on pursuit and evasion games played in Euclidean spaces in the tradition of Rado's "Lion versus Man" game. In some ways, these games can be viewed as continuous…

Many physical systems have underlying safety considerations that require that the strategy deployed ensures the satisfaction of a set of constraints. Further, often we have only partial information on the state of the system. We study the…

In this paper we consider a Target-guarding differential game where the Defender must protect a linearly moving line segment by intercepting the Attacker who tries to reach it. In contrast to common Target-guarding problems, we assume that…

Stealthy attacks are a major cyber-security threat. In practice, both attackers and defenders have resource constraints that could limit their capabilities. Hence, to develop robust defense strategies, a promising approach is to utilize…

The pursuit-evasion game with two persons is considered. Both players are moving in a metric space, have equal maximum speeds and complete information about the location of each other. We study the sufficient conditions for a capture (with…

We consider a class of jump games in which agents of different types occupy the nodes of a graph aiming to maximize the variety of types in their neighborhood. In particular, each agent derives a utility equal to the number of types…

The Explorer-Director game, first introduced by Nedev and Muthukrishnan, can be described as a game where two players -- Explorer and Director -- determine the movement of a token on the vertices of a graph. At each time step, the Explorer…

In many problem settings, most notably in game playing, an agent receives a possibly delayed reward for its actions. Often, those rewards are handcrafted and not naturally given. Even simple terminal-only rewards, like winning equals one…

We consider "Containment": a variation of the graph pursuit game of Cops and Robber in which cops move from edge to adjacent edge, the robber moves from vertex to adjacent vertex (but cannot move along an edge occupied by a cop), and the…

In the Firefighter problem, a fire breaks out at a vertex of a graph and at each subsequent time step, the firefighter chooses a vertex to protect and then the fire spreads from each burned vertex to every unprotected neighbour. The problem…

We consider a multi-player multi-armed bandit setting in the presence of adversaries that attempt to negatively affect the rewards received by the players in the system. The reward distributions for any given arm are heterogeneous across…