✦ LIBER ✦

Infiltration games on arbitrary graphs

✍ Scribed by Steve Alpern

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 148 KB
Volume: 163
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(92)90295-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A one-dimensional infiltration game

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

Pursuit—Evasion games on graphs

✍ F. R. K. Chung; Joel E. Cohen; R. L. Graham 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 324 KB

Two-person games on graphs

✍ Alvin E Roth 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 229 KB

An infiltration game on k arcs

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

Multicolorings, measures and games on gr

Multicolorings, measures and games on graphs

✍ F.H Clarke; R.E Jamison 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 606 KB

A fast infiltration game on n arcs

✍ V. J. Baston; A. Y. Garnaev 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 532 KB

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