ON PROFIT DENSITY BASED GREEDY ALGORITHM FOR A RESOURCE ALLOCATION PROBLEM IN WEB SERVICES

J. Sum, J. Wu, and C.-S. Leung

References

  1. [1] S. Martello & P. Toth, Knapsack problems: Algorithms and computer implementations (John Wiley & Sons, 1990).
  2. [2] C.H. Papadamitrious & K. Steiglitz, Combinatorial optimization: Algorithms and complexity (Dover, 1998).
  3. [3] E.S. Maskin & J.G. Riley, Optimal multi-unit auctions, in F. Hahn (ed.), The economics of missing markets, information, and games (Oxford: Oxford University Press, 1989).
  4. [4] H. Weisberg, The distribution of linear combinations of order statistics from the uniform distribution, Annals of Mathematical Statistics, 42, 1971, 704–709. doi:10.1214/aoms/1177693419
  5. [5] W. Feller, Probability theory: Volume II (Wiley, 1971).
  6. [6] B. Lehmann, D. Lehmann, & N. Nisan, Combinatorial auctions with decreasing marginal utilities, EC’01 (Tampa, FL, 2001).

Important Links:

Go Back