Question: Consider the simplified environment for Adwords . There is 1 ad shown for each query All advertisers have the same budget B All ads
Consider the simplified environment for Adwords . There is 1 ad shown for each query All advertisers have the same budget B All ads are equally likely All ads are equally likely to be clicked Value of each ad is the same (=1) The simplest algorithm for the above problem is greedy, i.e., for a query pick any advertiser who has bid 1 for that query. Please show that the greedy algorithm has competitive ratio as 1/2. (Hint: We have shown that the competitive ratio of the greedy algorithm for online graph matching problem is 1/2. We can convert this problem to the online graph matching problem by creating B copies of each advertiser with the budget of each copy as 1.)
Step by Step Solution
3.32 Rating (149 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
