No-information secretary problems with cardinal payoffs and Poisson arrivals

No-information secretary problem with Poisson stream of applicants is considered. The values of the applicants are random variables drawn from uniform distribution. The goal is to maximize the expectation of the value of the applicant under the condition that the decision maker can only stop on a candidate best so far. We also consider two modifications of this problem.