New Titles  |  FAQ  |  Keep Informed  |  Review Cart  |  Contact Us Quick Search (Advanced Search ) Browse by Subject General Interest Logic & Foundations Number Theory Algebra & Algebraic Geometry Discrete Math & Combinatorics Analysis Differential Equations Geometry & Topology Probability & Statistics Applications Mathematical Physics Math Education
Strategies for Sequential Search and Selection in Real Time
Edited by: F. Thomas Bruss, Thomas S. Ferguson, and Stephen M. Samuels
 SEARCH THIS BOOK:
Contemporary Mathematics
1992; 248 pp; softcover
Volume: 125
ISBN-10: 0-8218-5133-0
ISBN-13: 978-0-8218-5133-3
List Price: US$60 Member Price: US$48
Order Code: CONM/125

This volume contains the proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Strategies for Sequential Search and Selection in Real Time, held in June 1990 at the University of Massachusetts at Amherst. The conference focused on problems related to sequential observation of random variables and selection of actions in real time. Forty-seven researchers from twelve countries attended the conference.

The eighteen papers collected here span four broad topics. The first five papers deal with selection problems in which the reward or cost depends on the observations only through their ranks; such problems have come to be called secretary problems. The next group of papers focuses on sequential search, bandit problems, and scheduling. These are followed by four papers on multicriteria and competitive problems, and the volume ends with four papers on prophet inequalities, records, and extreme values. Aimed at graduate students and researchers in mathematics and statistics, this book will provide readers with a feeling for the breadth and depth of contemporary research in these areas.

• F. T. Bruss -- Optimal selection, learning and machine implementation
• T. S. Ferguson, J. P. Hardwick, and M. Tamaki -- Maximizing the duration of owning a relatively best object
• A. V. Gnedin and M. Sakaguchi -- On a best choice problem related to the Poisson process
• Z. Govindarajulu -- The secretary problem: optimal selection from two streams of candidates
• S. Silverman and A. Nádas -- On the game of Googol as the secretary problem
• E. A. Feinberg -- A Markov decision model of a search process
• E. L. Presman -- Properties of optimal strategies in the Poisson version of the two-armed bandit problem with two hypotheses
• R. Righter -- Multiprocessor scheduling and the sequential assignment problem
• E. Z. Ferenstein -- Two-person non-zero-sum sequential games with priorities
• T. S. Ferguson -- Best-choice problems with dependent criteria
• A. V. Gnedin -- Multicriteria extensions of the best choice problem: sequential selection without linear order
• M. Yasuda -- On a separation of a stopping game problem for standard Brownian motion
• F. Boshuizen -- Multivariate prophet inequalities for negatively dependent random vectors
• T. P. Hillard and R. P. Kertz -- A survey of prophet inequalities in optimal stopping theory
• T. P. Hillard and U. Krengel -- A prophet inequality related to the secretary problem
• D. P. Kennedy and R. P. Kertz -- Comparisons of optimal stopping values and expected suprema for i.i.d. r.v.'s with costs and discounting
• S. M. Samuels -- An all-at-once proof of Ignatov's theorem
• N. J. Schmitz -- Games against a prophet