Skip to main content

Estimating Optimal Stopping Rules in the Multiple Best Choice Problem with Minimal Summarized Rank via the Cross-Entropy Method

  • Chapter
Exploitation of Linkage Learning in Evolutionary Algorithms

Part of the book series: Evolutionary Learning and Optimization ((ALO,volume 3))

Abstract

The best choice problem is an important class of the theory of optimal stopping rules. In this article, we present the Cross-Entropy method for solving the multiple best choice problem with the minimal expected ranks of selected objects. We also compare computation results by Cross-Entropy method with results by the genetic algorithm. Computational results showed that the Cross-Entropy method is producing high-quality solution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bruss, F.t., Ferguson, T.S.: Minimizing the expected rank with full information. J.Appl. Prob. 30, 616–626 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chow, Y.S., Robbins, H., Siegmund, D.: Great Expectations: The Theory of Optimal Stopping. Houghton Mifflin, Boston (1971)

    MATH  Google Scholar 

  3. Chow, Y.S., Moriguti, S., Robbins, H., Samuels, S.M.: Optimal selection based on relative rank. Israel J.Math. 2, 81–90 (1964)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dynkin, E.B., Yushkevich, A.A.: Theorems and Problems on Markov Processes. Plenum, New York (1969)

    Google Scholar 

  5. Gabor, C.P., Halliday, T.R.: Sequential mate choice by multiply mating smooth newts: females become more choosy. Behavioral Ecology 8, 162–166 (1997)

    Article  Google Scholar 

  6. Gilbert, J.P., Mosteller, F.: Recognizing the maximum of sequence. J. Am. Stat. Assoc. 61, 35–73 (1966)

    Article  MathSciNet  Google Scholar 

  7. Cianini-Pettitt, J.: Optimal selection based on relative ranks with a random number of individuals. Adv. Appl. Prob. 11, 720–736 (1979)

    Article  Google Scholar 

  8. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Kluwer Academic Publishers, Boston (1989)

    MATH  Google Scholar 

  9. Nikolaev, M.L.: On a generalization of the best choice problem. Theory Prob. Appl. 22, 187–190 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  10. Nikolaev, M.L.: Optimal multi-stopping rules. Obozr. Prikl. Prom. Mat. 5, 309–348 (1998)

    MATH  MathSciNet  Google Scholar 

  11. Pitcher, T.E., Neff, B.D., Rodd, F.H., Rowe, L.: Multiple mating and sequential mate choice in guppies: females trade up. Proceedings of the Royal Society B: Biological Sciences 270, 1623–1629 (2003)

    Article  Google Scholar 

  12. Rubinstein, R.Y., Kroese, D.P.: The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization. In: Monte-Carlo Simulation and Machine Learning. Springer, New York (2004)

    Google Scholar 

  13. Shiryaev, A.N.: Optimal Stopping Rules. Springer, New York (1978)

    MATH  Google Scholar 

  14. Sofronov, G.Y., Kroese, D.P., Keith, J.M., Nikolaev, M.L.: Simulation of thresholds in the multiple best choice problem. Obozr. Prikl. Prom. Math. 13, 975–983 (2006)

    Google Scholar 

  15. Tamaki, M.: Minimal expected ranks for the secretary problems with uncertain selection. Lecture Notes-Monograph Series, vol. 35, pp. 127–139. Institute of Mathematical Statistics (2000)

    Google Scholar 

  16. Wang, R., Okazaki, K.: Solving facility layout problem using an improved genetic algorithm. IEICE Trans. Fundam. E88–A N2, 606–610 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Polushina, T.V. (2010). Estimating Optimal Stopping Rules in the Multiple Best Choice Problem with Minimal Summarized Rank via the Cross-Entropy Method. In: Chen, Yp. (eds) Exploitation of Linkage Learning in Evolutionary Algorithms. Evolutionary Learning and Optimization, vol 3. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12834-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12834-9_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12833-2

  • Online ISBN: 978-3-642-12834-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics