Question: Consider the following randomized algorithm ALG for the Time Series Search problem: Pick j in { 0 , . . . , log phi

Consider the following randomized algorithm ALG for the Time Series
Search problem: Pick j in {0,..., log \phi } uniformly at random. Trade all savings on the first day i such that the exchange rate pi satisfies pi >=(2^j)L. If no such exchange rate is encountered, trade all savings on the last day.
Prove that oblivious competitive ratio \rho OBL(ALG)<=2(log \phi +1).

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 Databases Questions!