We consider Web service providers, which have a finite capacity, and requests for their services, which arrive sequentially over time, and propose an online algorithm for selecting from such requests and charging for such requests. We show that different variations of this problem, both as online and offline (when we know all requests a priori), are hard problems. We initially start with two naive variations of the problem and show these variations are too hard to be solved. Then, we propose an

more »

... online algorithm for a variation of the problem where we make some statistical assumptions about the requests that Web service providers receive over time.