I had the idea that maybe probability/game theory knowledge helps finding a flat more systematically. I assume that I have some online offers with number parameters:
- size (square meters)
- distance (to work in minutes)
I have some limits for all of them, but there are still many offers remaining. Unfortunately, I have to decide immediately if I take a flat or not since otherwise it will be gone.
My main idea is to estimate how much more I can contraint these three parameters numerically and still find a flat within some reasonable time. Basically I define a stronger "soft limit" rather than the neccessary "hard limit". If I filter out too much, there will be too few offers and the search would take too long. From watching the offers I can estimate the distribution of these three parameters.
Of course there are more non-numerical parameters so just being within range doesn't qualify the flat completely. It still might be dismissed, due to other factors.
Any suggestions? (I know about the related "Secretary problem", but it wouldn't give me new limit numbers. And here, I wish a cardinal approach, rather than an ordinal approach)