Question: Problem 4 . ( 3 0 points ) ( a ) You have multiple bikes to sell. For simplicity, assume that you get one offer

Problem 4.(30 points)
(a) You have multiple bikes to sell. For simplicity, assume that you get one offer every day, with Xi denoting the offer received on day i. Here X1, X2,... are a sequence of independent random variables uniformly distributed in [0,1]. Now suppose that you accept every offer Xi,i >=2 such that Xi > X1. You always reject the offer X1 on day 1. Let Yn be the number of accepted offers until and including day n. That is, Yn = Pni=2 I(Xi > X1), where I() is the indicator function. What is E[Yn]?
1A standard 52-card deck is the set {2,3,4,5,6,7,8,9,10, jack, queen, king, ace}\times {clubs, diamonds, hearts, spades}.
1
(b) Consider the problem setting in part (a) again, and now let Zn be the number of accepted offers until and including day n assuming X1=1/2. That is, Zn = Pni=2 I(Xi >1/2), where I() is the indicator function. What is E[Zn]? Also, prove that with probability at least 1\delta , for any \delta in (0,1), we have that Zn <= n2+ O(pn log(1/\delta )). That is,
PrZn <= n2+O(pnlog(1/\delta )>=1\delta
Hint: Use Chernoff-Hoeffding bounds (Look here or here) Also familiarize yourself with the Big O notation.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!