This preview shows page 1. Sign up to view the full content.
Unformatted text preview: i has a winning probability of p i , then if it turns out to be a win, then the next bet will have winning probability of p 2 and if it is lose, the next one will have a winning probability of p 1 . Formulate this problem as a DP and try to solve it. 3. Suppose that, you do not have the winning probability in each play, but only know that, for the rst play, the winning probability is either p 1 or p 2 , with respective probabilities and 1- . What is your optimal gambling strategy in this case (hint: you need to periodically update the winning probability each and every time afteryou get). 4. Find the distance of the shortest path from Node 1 to Node 7 in the following graph using Dijkstras algorithm. 1...
View Full Document
- Spring '12