Article ID: | iaor19972346 |
Country: | Germany |
Volume: | 45 |
Issue: | 1 |
Start Page Number: | 119 |
End Page Number: | 131 |
Publication Date: | Jan 1997 |
Journal: | Mathematical Methods of Operations Research (Heidelberg) |
Authors: | Stadje W. |
Keywords: | programming: dynamic, decision: rules |
The following variant of a classical selection problem is considered. Offers of random size are successively available to a decision-maker at discrete time instants, and he has to select one without having the possibility of recall. At any time he can accept or reject the current offer based on some initial information (just received) on its still unknown size, or he can demand additional information and take his decision thereafter. The cost