Multiarmed Bandit Allocation Indices (Wiley Interscience Series in Systems & Optimization) - Tapa dura

Sinopsis

Statisticians are familiar with bandit problems, operational researchers with scheduling problems, and economists with problems of resource allocation. Most such problems are computationally intractable and cannot be solved in polynomial time - which means that accurate solutions are unobtainable except for small-scale problems. This is particularly true under conditions of uncertainty. This book shows that there is, however, a large class of allocation problems for which the optimal solution is expressible in terms of a priority index which is defined for each of the competing projects independently of the properties of the other projects. Such problems are therefore solved once the appropriate index has been found. In some cases there is a concise formula for the index; at worst it can usually be determined by a manageable calculation. Since the discovery of the index, which has become known as the Gittins index, its properties and its range of applicability have been worked out in some detail. This book, which inaugurates a series in systems and optimization, gives an account of these developments and includes the first extensive tables of index values.

"Sinopsis" puede pertenecer a otra edición de este libro.