# Hwk-2 - i has a winning probability of p i then if it turns...

This preview shows page 1. Sign up to view the full content.

Homework 2 Due: Sep 18th 2008 1. Consider the gambler’s problem discussed in class. The gambler can bet N times, but now consider the case that the winning probabilities for the N bets are p 1 ,p 2 ,...,p N . That is, the winning probability of the ﬁrst bet is p 1 , the second one is p 2 etc. Find the optimal gambling strategy in this case. The following two problems are variations of the ﬁrst, and they are optional. 2. Consider the ﬁrst problem, but assume that the winning probabilities can change. Speciﬁcally, let us assume that for the ﬁrst bet, the probability of winning is p 1 . If the ﬁrst one turns out to be a win, then the second bet only has winning probability of p 2 ( p 2 < p 1 ), and if it is a lose, then the next winning probability will remain p 1 . In general, for bet i , if bet
This is the end of the preview. Sign up to access the rest of the document.

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 Dijkstra’s algorithm. 1...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online