Kontakt
Jak nakupovat
Doručení
Nákupní rádce
Dynamic Priority Allocation in Restless Bandit Models
Designing simple and well-performing rules for dynamic and stochastic resource allocation problems
Angličtina
138 b
Až 30 dní na vrácení zboží
Zákazníci také koupili
Consider a collection of competitors with resource capacity demands that in aggregate are, at least at some time instants, beyond the available resource capacity. Suppose that to each competitor we can assign a value, independent of other competitors, that measures the efficiency of attaining a joint goal if a particular amount of resource capacity is allocated to her at a given moment. We are interested in designing and evaluating rules based on these values and the resource capacity demands which accomplish the goal of good resource capacity allocation, whatever "good" may mean. This book presents such a solution to three complex stochastic and dynamic resource allocation problems and describes a unified methodology for designing such rules. Such rules are important in practice, since they provide an easy-to-interpret and easy-to-implement solution to problems that are intractable for optimal solution due to the curse of dimensionality or they embody an elegant optimal solution in some problems with simpler structure. The book will be useful for practitioners and researchers in operations research, management, telecommunications, etc.
Informace o knize
Angličtina
Kategorie
Darujte tuto knihu ještě dnes
Je to snadné
1 Přidejte knihu do košíku a zvolte doručit jako dárek 2 Obratem vám zašleme poukaz 3 Kniha dorazí na adresu obdarovanéhoMohlo by vás také zajímat
/
Brožovaná
237
Kč
/
Brožovaná
340
Kč
/
Brožovaná
489
Kč
/
Brožovaná
336
Kč
Ahoj! Jsem Libroamiko, tvůj knižní rádce.
Jak ti můžu pomoct?