k - SNAP - Stanford University
k - SNAP - Stanford University
k - SNAP - Stanford University
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
…<br />
A 1 A 2 A 3 A N-1 A N<br />
B/(N-2)<br />
B/(N-1)<br />
B/N<br />
Balance assigns each of the queries in round 1 to N advertisers<br />
After k rounds, sum of allocations to each of advertisers A k,…,A N is<br />
S k = S k+1 = … = S N = ∑ i=1…k-1 B / (N-i+1)<br />
If we find the smallest k such that S k ≥ B, then after k rounds<br />
we cannot allocate any queries to any advertiser<br />
3/7/2011 Jure Leskovec, <strong>Stanford</strong> C246: Mining Massive Datasets<br />
29
Change language