Cookies?
Library Header Image
LSE Research Online LSE Library Services

Rendezvous-evasion search in two boxes with incomplete information

Gal, S. and Howard, J. V. (2003) Rendezvous-evasion search in two boxes with incomplete information. Operational Research working papers (LSEOR 03.60). Department of Operational Research, London School of Economics and Political Science, London, UK. ISBN 0753015242

[img]
Preview
PDF
Download (173kB) | Preview

Abstract

An agent (who may or may not want to be found) is located in one of two boxes. At time 0 suppose that he is in box B. With probability p he wishes to be found, in which case he has been asked to stay in box B. With probability p he tries to evade the searcher, in which case he may move between boxes A and B. The searcher looks into one of the boxes at times 1, 2, 3, ... . Between each search the agent may change boxes if he wants. The searcher is trying to minimise the expected time to discovery. The agent is trying to minimise this time if he wants to be found, but trying to maximise it otherwise. This paper nds a solution to this game (in a sense defined in the paper), associated strategies for the searcher and each type of agent, and a continuous value function v(p) giving the expected time for the agent to be discovered. The solution method (which is to solve an associated zero-sum game) would apply generally to this type of game of incomplete information.

Item Type: Monograph (Working Paper)
Official URL: http://www.lse.ac.uk/collections/operationalResear...
Additional Information: © 2003 London School of Economics and Political Science
Divisions: LSE
Subjects: Q Science > QA Mathematics
Date Deposited: 16 Feb 2009 15:14
Last Modified: 15 Sep 2023 22:54
URI: http://eprints.lse.ac.uk/id/eprint/22764

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics