A competitive search game with a moving target

08/27/2020
by   Benoit Duvocelle, et al.
0

We introduce a discrete-time search game, in which two players compete to find an object first. The object moves according to a time-varying Markov chain on finitely many states. The players know the Markov chain and the initial probability distribution of the object, but do not observe the current state of the object. The players are active in turns. The active player chooses a state, and this choice is observed by the other player. If the object is in the chosen state, this player wins and the game ends. Otherwise, the object moves according to the Markov chain and the game continues at the next period. We show that this game admits a value, and for any error-term >0, each player has a pure (subgame-perfect) -optimal strategy. Interestingly, a 0-optimal strategy does not always exist. The -optimal strategies are robust in the sense that they are 2-optimal on all finite but sufficiently long horizons, and also 2-optimal in the discounted version of the game provided that the discount factor is close to 1. We derive results on the analytic and structural properties of the value and the -optimal strategies. Moreover, we examine the performance of the finite truncation strategies, which are easy to calculate and to implement. We devote special attention to the important time-homogeneous case, where additional results hold.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/03/2020

At Most 43 Moves, At Least 29: Optimal Strategies and Bounds for Ultimate Tic-Tac-Toe

Ultimate Tic-Tac-Toe is a variant of the well known tic-tac-toe (noughts...
research
08/21/2020

Search for a moving target in a competitive environment

We consider a discrete-time dynamic search game in which a number of pla...
research
09/02/2021

Rendezvous on the Line with Different Speeds and Markers that can be Dropped at Chosen Time

In this paper we introduce a Linear Program (LP) based formulation of a ...
research
07/16/2021

The Convergence Rates of Blockchain Mining Games: A Markovian Approach

Understanding the strategic behavior of miners in a blockchain is of gre...
research
04/04/2020

Incentive compatibility in sender-receiver stopping games

We introduce a model of sender-receiver stopping games, where the state ...
research
03/16/2019

Active and Passive Portfolio Management with Latent Factors

We address a portfolio selection problem that combines active (outperfor...
research
10/04/2021

A Markov process approach to untangling intention versus execution in tennis

Value functions are used in sports applications to determine the optimal...

Please sign up or login with your details

Forgot password? Click here to reset