Standard

SEARCH PROBLEMS WITH AN IMMOVABLE HIDER. / Petrosjan, L. A.

IFAC Proceedings Series. ed. / N.K. Sinha; L.A. Telksnys. 2. ed. Pergamon Press, 1987. p. 239-241 (IFAC Proceedings Series; No. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Petrosjan, LA 1987, SEARCH PROBLEMS WITH AN IMMOVABLE HIDER. in NK Sinha & LA Telksnys (eds), IFAC Proceedings Series. 2 edn, IFAC Proceedings Series, no. 2, Pergamon Press, pp. 239-241.

APA

Petrosjan, L. A. (1987). SEARCH PROBLEMS WITH AN IMMOVABLE HIDER. In N. K. Sinha, & L. A. Telksnys (Eds.), IFAC Proceedings Series (2 ed., pp. 239-241). (IFAC Proceedings Series; No. 2). Pergamon Press.

Vancouver

Petrosjan LA. SEARCH PROBLEMS WITH AN IMMOVABLE HIDER. In Sinha NK, Telksnys LA, editors, IFAC Proceedings Series. 2 ed. Pergamon Press. 1987. p. 239-241. (IFAC Proceedings Series; 2).

Author

Petrosjan, L. A. / SEARCH PROBLEMS WITH AN IMMOVABLE HIDER. IFAC Proceedings Series. editor / N.K. Sinha ; L.A. Telksnys. 2. ed. Pergamon Press, 1987. pp. 239-241 (IFAC Proceedings Series; 2).

BibTeX

@inproceedings{d982e7da189a4a529646ca7c6cabe037,
title = "SEARCH PROBLEMS WITH AN IMMOVABLE HIDER.",
abstract = "The simultaneous zero-sum search game on the sphere C is considered. The point chosen by the hider is called 'discovered' if it lies in the r-neighbourhood of the points chosen by the searcher. The payoff of the searcher is equal to the number of discovered points. The case with a moving searcher is also considered. The optimal strategy of the searcher consists in the random throwing of the 'discovery region' on the sphere according to the probability distribution generated by the kinematic measure. The optimal mixed strategy of the hider and the value of the game are found.",
author = "Petrosjan, {L. A.}",
year = "1987",
month = dec,
day = "1",
language = "English",
isbn = "0080334520",
series = "IFAC Proceedings Series",
publisher = "Pergamon Press",
number = "2",
pages = "239--241",
editor = "N.K. Sinha and L.A. Telksnys",
booktitle = "IFAC Proceedings Series",
address = "United States",
edition = "2",

}

RIS

TY - GEN

T1 - SEARCH PROBLEMS WITH AN IMMOVABLE HIDER.

AU - Petrosjan, L. A.

PY - 1987/12/1

Y1 - 1987/12/1

N2 - The simultaneous zero-sum search game on the sphere C is considered. The point chosen by the hider is called 'discovered' if it lies in the r-neighbourhood of the points chosen by the searcher. The payoff of the searcher is equal to the number of discovered points. The case with a moving searcher is also considered. The optimal strategy of the searcher consists in the random throwing of the 'discovery region' on the sphere according to the probability distribution generated by the kinematic measure. The optimal mixed strategy of the hider and the value of the game are found.

AB - The simultaneous zero-sum search game on the sphere C is considered. The point chosen by the hider is called 'discovered' if it lies in the r-neighbourhood of the points chosen by the searcher. The payoff of the searcher is equal to the number of discovered points. The case with a moving searcher is also considered. The optimal strategy of the searcher consists in the random throwing of the 'discovery region' on the sphere according to the probability distribution generated by the kinematic measure. The optimal mixed strategy of the hider and the value of the game are found.

UR - http://www.scopus.com/inward/record.url?scp=0023570947&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0023570947

SN - 0080334520

T3 - IFAC Proceedings Series

SP - 239

EP - 241

BT - IFAC Proceedings Series

A2 - Sinha, N.K.

A2 - Telksnys, L.A.

PB - Pergamon Press

ER -

ID: 48343480