Before revision:  2) Next we consider few semi-adversarial inputs: random order of arrival with adversarially generated and sparse graphs. 3) Lastly we introduce a new model, which we call the friendly sequence model. We look at several online optimization problems : mincut, maxcut and submodular maximization and show that there are input ordering where a greedy strategy can produce an optimalanswer\mc .
After revision:  2) Next we consider few semi-adversarial inputs: random order of arrival with adversarially generated and sparse graphs. 3) Lastly we derive some structural properties of\mc .