相关论文: The Cat and the Noisy Mouse
Many natural processes rely on optimizing the success ratio of a search process. We use an experimental setup consisting of a simple online game in which players have to find a target hidden on a board, to investigate the how the rounds are…
Mutual imitation games among artificial birds are studied. By employing a variety of mappings and game rules, the evolution to the edge between chaos and windows is universally confirmed. Some other general features are observed, including…
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…
Several variations of hat guessing games have been popularly discussed in recreational mathematics. In a typical hat guessing game, after initially coordinating a strategy, each of $n$ players is assigned a hat from a given color set.…
In this paper, we investigate a pursuit-evasion game in which a mobile observer tries to track a target in an environment containing obstacles. We formulate the game as an optimal control problem with state inequality constraint in a simple…
Mirror games were invented by Garg and Schnieder (ITCS 2019). Alice and Bob take turns (with Alice playing first) in declaring numbers from the set {1,2, ...2n}. If a player picks a number that was previously played, that player loses and…
We consider a pursuit-evasion differential game with a Hybrid system of dynamics in Hilbert space with integral constraints on the control functions of players. We show that the pursuer has a winning strategy.
Wireless secret sharing is crucial to information security in the era of Internet of Things. One method is to utilize the effect of the randomness of the wireless channel in the data link layer to generate the common secret between two…
We consider a pursuit-evasion game that describes the process of extinguishing a fire burning on the nodes of an undirected graph. We denote the minimum number of firefighters required by ffn(G) and provide almost sharp bounds to this graph…
This paper considers a reach-avoid differential game in three-dimensional space with four equal-speed players. A plane divides the game space into a play subspace and a goal subspace. The evader aims at entering the goal subspace while…
A qualitative criterion for a pursuer to intercept a target in a class of differential games is obtained in terms of \emph{future cones}: Topological cones that contain all attainable trajectories of target or interceptor originating from…
We describe here a new concept of one group chasing another, called "group chase and escape", by presenting a simple model. We will show that even a simple model can demonstrate rather rich and complex behavior. In particular, there are…
This paper proposes a dynamic research contest, namely chasing contest, in which two asymmetric contestants exert costly effort to accomplish two breakthroughs. The contestants are asymmetric in that one of them is present-biased and has…
We study a finite-horizon differential game of pursuit-evasion like, between a single player and a mass of agents. The player and the mass directly control their own evolution, which for the mass is given by a first order PDE of transport…
This paper studies a multiplayer reach-avoid differential game in the presence of general polygonal obstacles that block the players' motions. The pursuers cooperate to protect a convex region from the evaders who try to reach the region.…
Concurrent multi-player games with $\omega$-regular objectives are a standard model for systems that consist of several interacting components, each with its own objective. The standard solution concept for such games is Nash Equilibrium,…
This paper studies a 3D multiplayer reach-avoid differential game with a goal region and a play region. Multiple pursuers defend the goal region by consecutively capturing multiple evaders in the play region. The players have heterogeneous…
Imagine an invisible rabbit that starts at some unknown integer point $A$ on the number line. At each time step, it hops by a fixed but unknown integer stride $B$. Both $A$ and $B$ are fixed integers, but their values are unknown. Suppose…
In this paper we introduce a new game; in this game there are two players who play as rival pirate gangs. The goal is to gather more treasure than your rival. The game is played on a graph and a player gathers treasure by moving to an…
We show that for many classes of symmetric two-player games, the simple decision rule "imitate-the-best" can hardly be beaten by any other decision rule. We provide necessary and sufficient conditions for imitation to be unbeatable and show…