Fr. 146.00

Multi-Armed Bandit Allocation Indices

English · Hardback

Shipping usually within 1 to 3 weeks (not available at short notice)

Description

Read more

Informationen zum Autor John Gittins , Statistics Department, University of Oxford, UK Kevin Glazebrook , Department of Management Science, Lancaster University, UK Richard Weber , Statistical Laboratory, University of Cambridge, UK Klappentext In 1989 the first edition of this book set out Gittins' pioneering index solution to the multi-armed bandit problem and his subsequent investigation of a wide of sequential resource allocation and stochastic scheduling problems. Since then there has been a remarkable flowering of new insights, generalizations and applications, to which Glazebrook and Weber have made major contributions.This second edition brings the story up to date. There are new chapters on the achievable region approach to stochastic optimization problems, the construction of performance bounds for suboptimal policies, Whittle's restless bandits, and the use of Lagrangian relaxation in the construction and evaluation of index policies. Some of the many varied proofs of the index theorem are discussed along with the insights that they provide. Many contemporary applications are surveyed, and over 150 new references are included.Over the past 40 years the Gittins index has helped theoreticians and practitioners to address a huge variety of problems within chemometrics, economics, engineering, numerical analysis, operational research, probability, statistics and website design. This new edition will be an important resource for others wishing to use this approach. Zusammenfassung In 1989 the first edition of this book set out Gittins' pioneering index solution to the multi-armed bandit problem and his subsequent investigation of a wide of sequential resource allocation and stochastic scheduling problems. Since then there has been a remarkable flowering of new insights, generalizations and applications, to which Glazebrook and Weber have made major contributions.This second edition brings the story up to date. There are new chapters on the achievable region approach to stochastic optimization problems, the construction of performance bounds for suboptimal policies, Whittle's restless bandits, and the use of Lagrangian relaxation in the construction and evaluation of index policies. Some of the many varied proofs of the index theorem are discussed along with the insights that they provide. Many contemporary applications are surveyed, and over 150 new references are included.Over the past 40 years the Gittins index has helped theoreticians and practitioners to address a huge variety of problems within chemometrics, economics, engineering, numerical analysis, operational research, probability, statistics and website design. This new edition will be an important resource for others wishing to use this approach. Inhaltsverzeichnis Foreword. Foreword to the first edition.   Preface. Preface to the first edition. 1 Introduction or Exploration. Exercises. 2 Main Ideas: Gittins Index. 2.1 Introduction. 2.2 Decision processes. 2.3 Simple families of alternative bandit processes. 2.4 Dynamic programming. 2.5 Gittins index theorem. 2.6 Gittins index. 2.7 Proof of the index theorem by interchanging bandit portions. 2.8 Continuous-time bandit processes. 2.9 Proof of the index theorem by induction and interchange argument. 2.10 Calculation of Gittins indices. 2.11 Monotonicity conditions. 2.12 History of the index theorem. 2.13 Some decision process theory. Exercises. 3 Necessary Assumptions for Indices. 3.1 Introduction. 3.2 Jobs. 3.3 Continuous-time jobs. 3.4 Necessary assumptions. 3.5 Beyond the necessary assumptions. Exercises. 4 Superprocesses, Precedence Constraints and Arrivals. 4.1 Introductio...

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.