Information content of online problems: advice versus determinism and randomization

@inproceedings{Smula2015InformationCO,
  title={Information content of online problems: advice versus determinism and randomization},
  author={Jasmin Smula},
  year={2015}
}
In online computation, an algorithm has to solve some optimization problem while receiving the input instance gradually, without any knowledge about the future input. Such an online algorithm has to compute parts of the output for parts of the input, based on what it knows about the input so far and without being able to revoke its decisions later. Almost inevitably, the algorithm makes a bad choice at some point that leads to a solution that is suboptimal with respect to the whole input… CONTINUE READING