Before revision:  While the classical Online Simple Knapsack Problem does not admit any constantly bounded competitive ratio in the deterministic setting, we find that adding the possibility of reservation makes the problem constantly competitive , with varying competitive ratios depending on the value of \alpha.
After revision:  We find that adding the possibility of reservation makes the problem constantly competitive , with varying competitive ratios depending on the value of \alpha.