All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 9 of 9

Showing per page

Hamilton–Jacobi equations and two-person zero-sum differential games with unbounded controls

Hong Qiu, Jiongmin Yong (2013)

ESAIM: Control, Optimisation and Calculus of Variations

A two-person zero-sum differential game with unbounded controls is considered. Under proper coercivity conditions, the upper and lower value functions are characterized as the unique viscosity solutions to the corresponding upper and lower Hamilton–Jacobi–Isaacs equations, respectively. Consequently, when the Isaacs’ condition is satisfied, the upper and lower value functions coincide, leading to the existence of the value function of the differential game. Due to the unboundedness of the controls,...

Handling a Kullback-Leibler divergence random walk for scheduling effective patrol strategies in Stackelberg security games

César U. S. Solis, Julio B. Clempner, Alexander S. Poznyak (2019)

Kybernetika

This paper presents a new model for computing optimal randomized security policies in non-cooperative Stackelberg Security Games (SSGs) for multiple players. Our framework rests upon the extraproximal method and its extension to Markov chains, within which we explicitly compute the unique Stackelberg/Nash equilibrium of the game by employing the Lagrange method and introducing the Tikhonov regularization method. We also consider a game-theory realization of the problem that involves defenders and...

Hercules versus Hidden Hydra Helper

Jiří Matoušek, Martin Loebl (1991)

Commentationes Mathematicae Universitatis Carolinae

L. Kirby and J. Paris introduced the Hercules and Hydra game on rooted trees as a natural example of an undecidable statement in Peano Arithmetic. One can show that Hercules has a “short” strategy (he wins in a primitively recursive number of moves) and also a “long” strategy (the finiteness of the game cannot be proved in Peano Arithmetic). We investigate the conflict of the “short” and “long” intentions (a problem suggested by J. Nešetřil). After each move of Hercules (trying to kill Hydra fast)...

How Long Can One Bluff in the Domination Game?

Boštan Brešar, Paul Dorbec, Sandi Klavžar, Gašpar Košmrlj (2017)

Discussiones Mathematicae Graph Theory

The domination game is played on an arbitrary graph G by two players, Dominator and Staller. The game is called Game 1 when Dominator starts it, and Game 2 otherwise. In this paper bluff graphs are introduced as the graphs in which every vertex is an optimal start vertex in Game 1 as well as in Game 2. It is proved that every minus graph (a graph in which Game 2 finishes faster than Game 1) is a bluff graph. A non-trivial infinite family of minus (and hence bluff) graphs is established. minus graphs...

Currently displaying 1 – 9 of 9

Page 1