Hostname: page-component-848d4c4894-m9kch Total loading time: 0 Render date: 2024-05-09T10:00:08.050Z Has data issue: false hasContentIssue false
  • English
  • Français

A High–Low search game on the unit interval

Published online by Cambridge University Press:  24 October 2008

V. J. Baston  and
F. A. Bostock
V. J. Baston
Affiliation:
Department of Mathematics, University of Southampton, Southampton SO9 5NH
F. A. Bostock
Affiliation:
Department of Mathematics, University of Southampton, Southampton SO9 5NH
Get access Rights & Permissions [Opens in a new window]

Extract

We consider the following two-person zero-sum game on the closed interval [0,1]. The hider chooses any real number h in [0,1]. The searcher successively chooses real numbers ξ1ξ2… in [0,1], where at each choice ξi he is told whether h = ξih < ξ1 or h > ξi and he may choose ξi+1 in the light of this information. The payoff (to the hider) is the sum of the distances of the searcher from the hider at each of the moves, that is .

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 97 , Issue 2 , March 1985 , pp. 345 - 348
Copyright
Copyright © Cambridge Philosophical Society 1985

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Gal, S.. A discrete search game. SIAM J. Appl. Math. 27 (1974), 641–648.CrossRefGoogle Scholar
[2]Gal, S.. A stochastic search game. SIAM J. Appl. Math. 34 (1978), 205–210.CrossRefGoogle Scholar
[3]Johnson, S. M.. A search game. Advances in Game Theory (Princeton University Press, 1964), pp. 39–48.Google Scholar
[4]Luenberger, D. G.. Introduction to Linear and Nonlinear Programming (Addison-Wesley), p. 119.Google Scholar
[5]Murakami, S.. A dichotomous search with travel cost. J. Oper. Res. Soc, Japan 19 (1976), 246–254.Google Scholar