Contact
How to shop
Delivery
Shopping guide
Dynamic Priority Allocation in Restless Bandit Models
Designing simple and well-performing rules for dynamic and stochastic resource allocation problems
English
155 b
Delivery to Austria
Up to 30 days for returns
Customers also purchased
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.
About the book
English
Categories
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
10.69
€
/
Paperback
15.39
€
/
Paperback
21.99
€
/
Paperback
20.99
€
/
Paperback
15.09
€
Hi! I'm Libroamiko, your book advisor.
How can I help you?