| Article ID: | iaor19952229 |
| Country: | Germany |
| Volume: | 40 |
| Start Page Number: | 229 |
| End Page Number: | 238 |
| Publication Date: | Apr 1994 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Schmitz N.J. |
| Keywords: | programming: dynamic |
For a game-theoretical problem of optimal choice with interview costs and discounting, the paper proves, using a saddle-point argument, the strict determinedness of the game and it gives minimax strategies for both players.