Complexity of Online Algorithms - CSIS
Complexity of Online Algorithms - CSIS
Complexity of Online Algorithms - CSIS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Relating the Adversaries<br />
Theorem (without pro<strong>of</strong>): [applicable for a general class<br />
<strong>of</strong> request-answer problems including paging]<br />
• If there is a randomized algorithm R that is -<br />
competitive against every adaptive online adversary,<br />
and there is a -competitive randomized algorithm<br />
against any oblivious adversary then R is (*) –<br />
competitive any adaptive <strong>of</strong>fline adversary.<br />
Implication (for paging): ??
Change language