Computing the optimal mixed strategy for various ambush games

Farmey Joseph, Eric Feron

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations


This paper studies a variety of ambush games in which one player must navigate between an origin and a destination, and the other player seeks to intercept and ambush him. These games include single-stage games, in which all decisions are made at the outset of the game, and multi-stage games, in which the second player may choose his ambush locations based on real-time updates of the first player's position. For both types of ambush games, methods are presented for efficiently computing the optimal mixed strategies for the first player to navigate between the origin and destination, so as to minimize the probability of being ambushed.
Original languageEnglish (US)
Title of host publication43rd Annual Allerton Conference on Communication, Control and Computing 2005
PublisherUniversity of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Number of pages10
ISBN (Print)9781604234916
StatePublished - Jan 1 2005
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2021-02-18


Dive into the research topics of 'Computing the optimal mixed strategy for various ambush games'. Together they form a unique fingerprint.

Cite this