Abstract
A class of games is considered in which the first player chooses a positive function and the second player chooses a number. It is shown that under certain conditions, the minimax strategy for the first player is an exponential function. The results obtained are applied to several search games.
Original language | English |
---|---|
Pages (from-to) | 324-348 |
Number of pages | 25 |
Journal | SIAM Journal on Applied Mathematics |
Volume | 30 |
Issue number | 2 |
DOIs | |
State | Published - 1976 |
ASJC Scopus subject areas
- Applied Mathematics