Title	Admission Policies for Complex Resource Allocation Problems
Creator	Taylor, Peter
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2020-08-21T16:02
Description	There are many applications where users of different types arrive to a finite set of resources and request temporary use of subsets of these resources. The manager of the resources is entitled to charge for their use and might incur some costs in making them available.</p> In this context, the manager has an admission control problem. Given the current state of allocation, can they admit a user of a particular type If they can, should they, or wait for a more lucrative user to arrive in the future In the situation where a user is indifferent between different sets of resources, which ones should they choose</p> In this talk I shall discuss my long history of engaging with different versions of this problem, culminating with some current work with Jing Fu and Bill Moran in which we are looking at a restless multi-armed bandit formulation.</p>
Extent	-945.0833333333334 minutes
Subject	Mathematics; Mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Melbourne
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2021-02-18
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0395900
URI	http://hdl.handle.net/2429/77324
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos

Admission Policies for Complex Resource Allocation Problems Taylor, Peter

Description

Item Metadata

Item Media

Item Citations and Data

Rights