Approximation algorithms for dynamic resource allocation

Authors:
Vivek F. Farias;Benjamin Van Roy
Affiliations:
Electrical Engineering, Stanford University, Stanford, CA, USA;Department of Management Science and Engineering, Terman Engineering Center 427, Stanford, CA 94305-4023, USA
Venue:
Operations Research Letters
Year:
2006

Citing 2
Cited 1

Probabilistic construction of deterministic algorithms: approximating packing integer programs

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
On Multidimensional Packing Problems

SIAM Journal on Computing

Online stochastic weighted matching: improved approximation algorithms

WINE'11 Proceedings of the 7th international conference on Internet and Network Economics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility.