Fair charge heuristics for dynamic resource allocation --- a queueing example
- π€ Speaker: David Hodge, Lancaster University
- π Date & Time: Monday 03 November 2008, 14:00 - 15:00
- π Venue: MR15, CMS, Wilberforce Road, Cambridge, CB3 0WB
Abstract
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.
Series This talk is part of the Optimization and Incentives Seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- CMS Events
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- Economics and Computer Science Talks
- Hanchen DaDaDash
- Interested Talks
- MR15, CMS, Wilberforce Road, Cambridge, CB3 0WB
- Optimization and Incentives Seminar
- School of Physical Sciences
- Statistical Laboratory info aggregator
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)


Monday 03 November 2008, 14:00-15:00