Continuous patrolling and hiding games

Tristan Garrec

European Journal of Operational Research, 2019, vol. 277, issue 1, 42-51

Abstract: We present two zero-sum games modeling situations where one player attacks (or hides in) a finite dimensional nonempty compact set, and the other tries to prevent the attack (or find him). The first game, called patrolling game, corresponds to a dynamic formulation of this situation in the sense that the attacker chooses a time and a point to attack and the patroller chooses a continuous trajectory to maximize the probability of finding the attack point in a given time. Whereas the second game, called hiding game, corresponds to a static formulation in which both the searcher and the hider choose simultaneously a point and the searcher maximizes the probability of being at distance less than a given threshold of the hider.

Keywords: Games theory; Noncooperative; Military; Search/surveillance; Networks (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221719301547
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:277:y:2019:i:1:p:42-51

DOI: 10.1016/j.ejor.2019.02.026

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().