# What is the name of this problem about maximizing the accepted offer from consecutive offers?

There was a problem I have read more than 15 years ago. I just remember the problem and the rough outline of the solution, and I would like to know if it has a canonical name to look up the calculation and variations.

The problem is that you will receive a 100 offers in sequence, you can only accept or reject in order, and once you have rejected an offer, you cannot go back. What is your strategy to maximize your gains? This might also be a problem-family, and I might not remember a couple of assumptions, if they turn out to be necessary.

And the solution was roughly...

If you have N offers, you wait until some constant (some function of e maybe?) times square root N, then you accept the first offer that is larger than or equal to the maximum of the first batch.

• It's "how to choose a wife" problem ;) Commented Jul 16, 2022 at 10:43
• @DmitryKamenetsky That was it, thank you as well! Commented Jul 17, 2022 at 10:18