Govindarajulu, Z.; Utikal, Klaus J. - University of Bonn, Germany - 1994
Consider a random permutation of a finite number $n$ of known elements representing rewards. These rewards will be made or not made with certain known probabilities. At any stage a reward made can be accepted or rejected, there is no recall and only one reward can be accepted. The problem is to...
