I need to prove that the modification of MTF, Move to front on every even request of an element, list update problem has a competitive ratio of 2.How does one go about proving such results? (I'm aware of the amortized analysis but not sure how to apply in this case)
Competitive ratio of Move To Front in alternate access - List Update Problem
ds.algorithms;online algorithms