In an industrial town, there are 3 bakeries X, Y, Z which sell the same bread at distinct prices. Everyday, their prices are randomly ordered such that each of the 6 possible orderings (3!=6) is equally likely. You can't know the prices until you visit the bakeries. After work, while people walk along the route they buy bread for the next morning at one of the 3 shops. The following are their behavioral pattern observed for long:
Which bakery has the best location?
List X, Y, Z in order from the most visited to the least visited shop.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Checking the price at X and buying bread there without further investigation can't be optimal because they can always come back to X after checking with Y. So, let's see what happens when they check the price at X, and then check with Y.
Case 1: Price is cheaper at X than at Y (for short, X < Y) with probability 2 1 . ( Comparing only X and Y, this probability is 2 1 , not 3 1 . )
That is, given the information X < Y, the probability of X being the cheapest is 3 2 , while that of Z being the cheapest is 3 1 .
Case 2: Price is cheaper at Y than at X (i.e. X > Y) with probability 2 1 .
That is, given the information X > Y, the probability of Y being the cheapest is 3 2 , while that of Z being the cheapest is 3 1 .
Therefore, the following are the probabilities that they will end up shopping at X, Y, Z, respectively: X : 2 1 , Y : 2 1 × 3 2 = 3 1 , Z : 2 1 × 3 1 = 6 1 , which implies that they are most likely to buy bread at X and least likely to buy it at Z.
So, the answer is XYZ. □