Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract)

We generalize the model of online computation with three players algorithm, adversary and an oracle called advisor by strengthening the power of the adversary by randomization. In our generalized model, the advisor knows everything about the adversary except the random bits the adversary may use. We examine the expected competitive ratio of online algorithms within this model in order to measure the hardness of online problems in a new way. We start our investigation by proving upper and lower bounds on the competitive ratio for the online graph coloring problem.