We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Admission policies for complex resource allocation problems (Keynote)

00:00

Formale Metadaten

Titel
Admission policies for complex resource allocation problems (Keynote)
Serientitel
Anzahl der Teile
12
Autor
Mitwirkende
Lizenz
CC-Namensnennung - keine kommerzielle Nutzung - keine Bearbeitung 4.0 International:
Sie dürfen das Werk bzw. den Inhalt in unveränderter Form zu jedem legalen und nicht-kommerziellen Zweck nutzen, vervielfältigen, verbreiten und öffentlich zugänglich machen, sofern Sie den Namen des Autors/Rechteinhabers in der von ihm festgelegten Weise nennen.
Identifikatoren
Herausgeber
Erscheinungsjahr
Sprache

Inhaltliche Metadaten

Fachgebiet
Genre
Abstract
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. 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? 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.