h*****n
发帖数: 38 | 1 Anyone knows how to solve this?
Suppose you drive in the highway and you know there are n hotels total on
this
highway. you have a preference ranking for each hotel, such as you like A
hotel
more than you like B hotel. You are allowed to stop only once, what is the
strategy you use, so that when you stop it is most likely you are at the
hotel
you most like?
Note:
1. if you drive by a hotel, you know the name of the hotel, hence you
know if that hotel is better than the ones you encountered befor | t*s
发帖数: 1504 | 2 divide n into 2 parts, learning part + rest
【在 h*****n 的大作中提到】
: Anyone knows how to solve this?
: Suppose you drive in the highway and you know there are n hotels total on
: this
: highway. you have a preference ranking for each hotel, such as you like A
: hotel
: more than you like B hotel. You are allowed to stop only once, what is the
: strategy you use, so that when you stop it is most likely you are at the
: hotel
: you most like?
: Note:
| s*****n
发帖数: 209 | 3 Your problem was not well defined. It can be better defined as follows:
The n hotels are randomly selected from a set of hotels whose quality
is known to you. (Repetition is possible because otherwise n will have
to be small.)
The answer: Since the hotels are randomly selected and randomly distributed,
each encounter of a hotel is an independent random event, and hence there
is no strategy. You cannot use past experience to learn about future
for independent random event, other than its |
|
