This preview shows page 1. Sign up to view the full content.
Unformatted text preview: b) Based on this reduction, show that there is an optimal policy that amounts to ranking the queues and at each time serving the highest-ranked queue that has customers. c) Derive a simple formula for ranking the queues in a way that leads to an optimal policy. Coin Tossing Suppose we are faced with 10 possibly biased coins. Each coins bias (probability of heads) is either 2 / 3 or 1 / 3. Our prior probabilities over the possible biases of each coin are independent and uniform. At each time, we choose one coin to ip and receive $1 if the coin lands heads (and nothing if it lands tails). Each coin can be ipped at most 100 times. Our objective is to maximize expected discounted revenue, with a discount factor of 0 . 99. Compute an optimal strategy that selects the next coin to ip given observations to date....
View Full Document
This note was uploaded on 02/15/2011 for the course EECS 6.231 taught by Professor Bertsekas during the Spring '10 term at MIT.
- Spring '10