Search for a moving target in a competitive environment

Benoit Duvocelle; Janos Flesch; Hui Min Shi; Dries Vermeulen

doi:10.1007/s00182-021-00761-5

Search for a moving target in a competitive environment

Benoit Duvocelle^*, Janos Flesch, Hui Min Shi, Dries Vermeulen

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

We consider a discrete-time dynamic search game in which a number of players compete to find an invisible object that is moving according to a time-varying Markov chain. We examine the subgame perfect equilibria of these games. The main result of the paper is that the set of subgame perfect equilibria is exactly the set of greedy strategy profiles, i.e. those strategy profiles in which the players always choose an action that maximizes their probability of immediately finding the object. We discuss various variations and extensions of the model.

Original language	English
Pages (from-to)	547-557
Number of pages	11
Journal	International Journal of Game Theory
Volume	50
Issue number	2
Early online date	17 Feb 2021
DOIs	https://doi.org/10.1007/s00182-021-00761-5
Publication status	Published - Jun 2021

Keywords

Game theory
Search game
Optimal search
Greedy strategy
Subgame perfect equilibrium

Access to Document

10.1007/s00182-021-00761-5Licence: CC BY

Cite this

@article{457587416388407596ea6e3ef3374b56,

title = "Search for a moving target in a competitive environment",

abstract = "We consider a discrete-time dynamic search game in which a number of players compete to find an invisible object that is moving according to a time-varying Markov chain. We examine the subgame perfect equilibria of these games. The main result of the paper is that the set of subgame perfect equilibria is exactly the set of greedy strategy profiles, i.e. those strategy profiles in which the players always choose an action that maximizes their probability of immediately finding the object. We discuss various variations and extensions of the model.",

keywords = "Game theory, Search game, Optimal search, Greedy strategy, Subgame perfect equilibrium",

author = "Benoit Duvocelle and Janos Flesch and Shi, {Hui Min} and Dries Vermeulen",

note = "No data used",

year = "2021",

month = jun,

doi = "10.1007/s00182-021-00761-5",

language = "English",

volume = "50",

pages = "547--557",

journal = "International Journal of Game Theory",

issn = "0020-7276",

publisher = "Springer Verlag",

number = "2",

}

TY - JOUR

T1 - Search for a moving target in a competitive environment

AU - Duvocelle, Benoit

AU - Flesch, Janos

AU - Shi, Hui Min

AU - Vermeulen, Dries

N1 - No data used

PY - 2021/6

Y1 - 2021/6

N2 - We consider a discrete-time dynamic search game in which a number of players compete to find an invisible object that is moving according to a time-varying Markov chain. We examine the subgame perfect equilibria of these games. The main result of the paper is that the set of subgame perfect equilibria is exactly the set of greedy strategy profiles, i.e. those strategy profiles in which the players always choose an action that maximizes their probability of immediately finding the object. We discuss various variations and extensions of the model.

AB - We consider a discrete-time dynamic search game in which a number of players compete to find an invisible object that is moving according to a time-varying Markov chain. We examine the subgame perfect equilibria of these games. The main result of the paper is that the set of subgame perfect equilibria is exactly the set of greedy strategy profiles, i.e. those strategy profiles in which the players always choose an action that maximizes their probability of immediately finding the object. We discuss various variations and extensions of the model.

KW - Game theory

KW - Search game

KW - Optimal search

KW - Greedy strategy

KW - Subgame perfect equilibrium

U2 - 10.1007/s00182-021-00761-5

DO - 10.1007/s00182-021-00761-5

M3 - Article

SN - 0020-7276

VL - 50

SP - 547

EP - 557

JO - International Journal of Game Theory

JF - International Journal of Game Theory

IS - 2

ER -

Search for a moving target in a competitive environment

Abstract

Keywords

Access to Document

Fingerprint

Cite this