相关论文: The Cat and the Noisy Mouse

This paper explores the connection between steganography and adversarial images. On the one hand, ste-ganalysis helps in detecting adversarial perturbations. On the other hand, steganography helps in forging adversarial perturbations that…

We analyze the following version of the deterministic \hats game. We have a graph $G$, and a sage resides at each vertex of $G$. When the game starts, an adversary puts on the head of each sage a hat of a color arbitrarily chosen from a set…

Two-player games have had a long and fruitful history of applications stretching across the social, biological, and physical sciences. Most applications of two-player games assume synchronous decisions or moves even when the games are…

This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take part in a two-player game over a network of nodes whose…

This work contains the mathematical exploration of a few prototypical games in which central concepts from statistics and probability theory naturally emerge. The first two kinds of games are termed Fisher and Bayesian games, which are…

In the Hunters and Rabbit game, $k$ hunters attempt to shoot an invisible rabbit on a given graph $G$. In each round, the hunters select $k$ vertices to shoot at, while the rabbit moves along an edge of $G$. The hunters win if, at any…

This paper presents a game theoretic formulation of a graph traversal problem, with applications to robots moving through hazardous environments in the presence of an adversary, as in military and security scenarios. The blue team of robots…

People make strategic decisions many times a day - during negotiations, when coordinating actions with others, or when choosing partners for cooperation. The resulting dynamics can be studied with learning theory and evolutionary game…

This paper studies a class of approach-evasion differential games, in which one player aims to steer the state of a dynamic system to the given target set in minimum time, while avoiding some set of disallowed states, and the other player…

The 'Cheating Robot' version of Cops and Robbers is played on a finite, simple, connected graph. The players move in the same time period. However, before moving, the robot observes to which vertices the cops are moving and it is fast…

Algorithms for motion planning in unknown environments are generally limited in their ability to reason about the structure of the unobserved environment. As such, current methods generally navigate unknown environments by relying on…

In this paper, we address a pursuit-evasion game involving multiple players by utilizing tools and techniques from reinforcement learning and matrix game theory. In particular, we consider the problem of steering an evader to a goal…

If we consider a cat to be an isolated mechanical system governed by T-invariant mechanics, then its ability to land on its feet after being released from rest is incomprehensible. It is more appropriate to treat the cat as a creature that…

Missiles pose a major threat to aircraft in modern air combat. Advances in technology make them increasingly difficult to detect until they are close to the target and highly resistant to jamming. The evasion maneuver is the last line of…

We consider the problem of obtaining sparse positional strategies for safety games. Such games are a commonly used model in many formal methods, as they make the interaction of a system with its environment explicit. Often, a winning…

In the game of $n-Sim$, two players take it in turn to claim unclaimed edges from a complete graph on $n$ vertices, with the first person to create a triangle in his own edges being the loser. We present some strategy-stealing arguments…

In the literature of game theory, the information sets of extensive form games have different interpretations, which may lead to confusions and paradoxical cases. We argue that the problem lies in the mix-up of two interpretations of the…

We introduce a new game played on graphs, ``Agents and Adversary". This game is reminiscent of ``Cops and Robbers" but has some fundamental differences. We classify infinite families of graphs as Agents-win and Adversary-win. We then define…

The cops and robbers game has been extensively studied under the assumption of optimal play by both the cops and the robbers. In this paper we study the problem in which cops are chasing a drunk robber (that is, a robber who performs a…

Maintenance of cooperation was studied for a two-strategy evolutionary Prisoner's Dilemma game where the players are located on a one-dimensional chain and their payoff comes from games with the nearest and next-nearest neighbor…