A SEARCH GAME,

Abstract

A hide-and-seek game is formulated and partially solved. The hider chooses an integer from 1 to n; the hunter makes a guess, is told whether he is too high or too low. The process is repeated until he has guessed correctly. The payoff is the expected number of guesses. Possible practical applications include the problem of correctly weighing an object with minimum expected number of weighings on a balance scale playing against nature. (Author)

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1964
Accession Number
AD0435869

Entities

People

  • Selmer M. Johnson

Organizations

  • RAND Corporation

Tags

Readers

  • Game Theory.
  • Mathematics or Statistics
  • Operations Research