University of Cambridge > Talks.cam > Optimization and Incentives Seminar > Fair charge heuristics for dynamic resource allocation --- a queueing example

Fair charge heuristics for dynamic resource allocation --- a queueing example

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Neil Walton.

We develop a notion of a fair charge for the allocation of additional resource to a reward earning object (project) whose stochastic evolution depends upon how much resource it receives. Under a critical condition, heuristics based on such fair charges are effective for problems concerning the dynamic allocation of a divisible resource (money, manpower) among a set of such projects. We illustrate ideas by reference to a queueing example in which a set of servers is to be dynamically allocated to a collection of service stations.

Keywords: Gittins’ Indices, Whittle relaxation, restless bandits.

This talk is part of the Optimization and Incentives Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity