DISCRETE SEARCH GAME.

Shmuel Gal

doi:10.1137/0127054

DISCRETE SEARCH GAME.

Shmuel Gal

Department of Statistics

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

Abstract

The following search game is considered: the first player, to be called the hider, chooses y, an integer from the set of integers 1 to N. The second player, to be called the searcher, guesses an integer from 1 to N and is told whether his guess is or is not too low; he continues to guess until he identifies y. The payoff to the hider is the number of guesses by the searcher. The optimal (mixed) strategies for both players and the value of this game are presented.

Original language	English
Pages (from-to)	641-648
Number of pages	8
Journal	SIAM Journal on Applied Mathematics
Volume	27
Issue number	4
DOIs	https://doi.org/10.1137/0127054
State	Published - 1974

ASJC Scopus subject areas

Applied Mathematics

Access to Document

10.1137/0127054

Cite this

@article{0c64a8b5a5dc4b5e8b53cc52f5c16e59,

title = "DISCRETE SEARCH GAME.",

abstract = "The following search game is considered: the first player, to be called the hider, chooses y, an integer from the set of integers 1 to N. The second player, to be called the searcher, guesses an integer from 1 to N and is told whether his guess is or is not too low; he continues to guess until he identifies y. The payoff to the hider is the number of guesses by the searcher. The optimal (mixed) strategies for both players and the value of this game are presented.",

author = "Shmuel Gal",

year = "1974",

doi = "10.1137/0127054",

language = "English",

volume = "27",

pages = "641--648",

journal = "SIAM Journal on Applied Mathematics",

issn = "0036-1399",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "4",

}

TY - JOUR

T1 - DISCRETE SEARCH GAME.

AU - Gal, Shmuel

PY - 1974

Y1 - 1974

N2 - The following search game is considered: the first player, to be called the hider, chooses y, an integer from the set of integers 1 to N. The second player, to be called the searcher, guesses an integer from 1 to N and is told whether his guess is or is not too low; he continues to guess until he identifies y. The payoff to the hider is the number of guesses by the searcher. The optimal (mixed) strategies for both players and the value of this game are presented.

AB - The following search game is considered: the first player, to be called the hider, chooses y, an integer from the set of integers 1 to N. The second player, to be called the searcher, guesses an integer from 1 to N and is told whether his guess is or is not too low; he continues to guess until he identifies y. The payoff to the hider is the number of guesses by the searcher. The optimal (mixed) strategies for both players and the value of this game are presented.

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

U2 - 10.1137/0127054

DO - 10.1137/0127054

M3 - Article

AN - SCOPUS:0016351278

SN - 0036-1399

VL - 27

SP - 641

EP - 648

JO - SIAM Journal on Applied Mathematics

JF - SIAM Journal on Applied Mathematics

IS - 4

ER -

DISCRETE SEARCH GAME.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this