Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Journal of Algorithms
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Memory versus randomization in on-line algorithms
IBM Journal of Research and Development
The dynamic and stochastic knapsack problem with deadlines
Management Science
Competitive solutions for online financial problems
ACM Computing Surveys (CSUR)
Online computation and competitive analysis
Online computation and competitive analysis
Competitive analysis of incentive compatible on-line auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Competitive auctions and digital goods
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Competitive Analysis of Algorithms
Developments from a June 1996 seminar on Online algorithms: the state of the art
The Dynamic and Stochastic Knapsack Problem
Operations Research
Technical note—Web service credentials
IBM Systems Journal
Service Allocation for Composite Web Services Based on Quality Attributes
CECW '05 Proceedings of the Seventh IEEE International Conference on E-Commerce Technology Workshops
| Hi-index | 0.00 |
We consider Web service providers, which have a finite capacity, and requests for their services, which arrive sequentially overtime, and propose an online algorithm for selecting from such requests and charging for such requests. We show that differentvariations 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 online algorithm for a variation of the problem where we make some statistical assumptions about the requests that Web service providers receive over time.