✦ LIBER ✦

A fast infiltration game on n arcs

✍ Scribed by V. J. Baston; A. Y. Garnaev

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 532 KB
Volume: 43
Category: Article
ISSN: 0894-069X
DOI: 10.1002/(sici)1520-6750(199606)43:4<481::aid-nav2>3.0.co;2-3

No coin nor oath required. For personal study only.

✦ Synopsis

Starting from a safe base, an Infiltrator tries to reach a sensitive zone within a given time limit without being detected by a Guard. The Infiltrator can move with speed at most u , while the Guard can only perform a restricted number of searches. A discrete variant of this zero-sum game played on a graph consisting of two vertices joined by n nonintersecting arcs is investigated. Optimal strategies and an explicit expression for its value are obtained.

📜 SIMILAR VOLUMES

An infiltration game on k arcs

✍ John M. Auger 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 948 KB

A one-dimensional infiltration game

✍ S. P. Lalley 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB 👁 1 views

A Hamiltonian game on Kn,n

✍ Xiaoyun Lu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Let K,,, be the complete bipartite graph of order 2n. Two players, maker and breaker, alternately take previously untaken edges of K,.,, one edge per move, with the breaker going first. The game ends when all edges of K,,, have been taken. Then the edges taken by the maker induce a graph G. The make

The game of “N questions” on a tree

✍ Ronald L. Rivest 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 330 KB

On ε-equilibrium point in a noncooperati

On ε-equilibrium point in a noncooperative n-person game

✍ Kensuke Tanaka; Kazunori Yokoyama 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 450 KB

On an N-person noncooperative Markov gam

On an N-person noncooperative Markov game with a metric state space

✍ Hang-Chin Lai; Kensuke Tanaka 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 787 KB