Is there known any complexity class containing online counterparts of optimization problems? If not, then how such class can be defined?
We know that many problems have their online version: e.g. online version of bin packing problem. The online problems are harder as measured by their competitive ratios.
And I haven't found anything similar in complexity zoo.
Essentially, we could say that there are no online problems, but only online algorithms for offline problems. However, if there are online problems, why there can't be complexity class containing them?