PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
August 1, 1987Journal of the Operational Research Society588 citationsOpen Access

Bandit Problems, Sequential Allocation of Experiments.

PJPeter W. JonesDBD. A. BerryBFB. Fristedt

Key Points

Key points are not available for this paper at this time.

Abstract

Our purpose in writing this monograph is to give a comprehensive treatment of the subject. We define bandit problems and give the necessary foundations in Chapter 2. Many of the important results that have appeared in the literature are presented in later chapters; these are interspersed with new results. We give proofs unless they are very easy or the result is not used in the sequel. We have simplified a number of arguments so many of the proofs given tend to be conceptual rather than calculational. All results given have been incorporated into our style and notation. The exposition is aimed at a variety of types of readers. Bandit problems and the associated mathematical and technical issues are developed from first principles. Since we have tried to be comprehens ive the mathematical level is sometimes advanced; for example, we use measure-theoretic notions freely in Chapter 2. But the mathema tically uninitiated reader can easily sidestep such discussion when it occurs in Chapter 2 and elsewhere. We have tried to appeal to graduate students and professionals in engineering, biometry, econ omics, management science, and operations research, as well as those in mathematics and statistics. The monograph could serve as a reference for professionals or as a telA in a semester or year-long graduate level course.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Jones et al. (1987) studied this question.

synapsesocial.com/papers/6a17261362528a85c605979chttps://doi.org/10.2307/2582852
Ask AI
Helpful
Bookmark
Share
View Full Paper