Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1143415 | Operations Research Letters | 2006 | 11 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Vivek F. Farias, Benjamin Van Roy,