Skip to main content

The Binary Bridge Selection Problem: Stochastic Approximations and the Convergence of a Learning Algorithm

  • Conference paper
Book cover Ant Colony Optimization and Swarm Intelligence (ANTS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5217))

Abstract

We consider an ant-based algorithm for binary bridge selection, and analyze its convergence properties with the help of techniques from the theory of stochastic approximations.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Deneubourg, J.L., Aron, S., Goss, S., Pasteels, J.M.: The self-organizing exploratory pattern of the Argentine ant. Journal of Insect Behavior 3, 159–168 (1990)

    Article  Google Scholar 

  2. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems, Santa Fe Institute Studies in the Sciences of Complexity. Oxford University Press, Oxford (1999)

    MATH  Google Scholar 

  3. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  4. Pasteels, J.M., Deneubourg, J.L., Goss, S.: Self-organization mechanisms in ant societies (I): Trail recruitment to newly discovered food sources. Experientia Suppl. 54, 155–175 (1987)

    Google Scholar 

  5. Kushner, H.J., Yin, G.: Stochastic Approximation Algorithms and Applications. Springer, New York (1997)

    MATH  Google Scholar 

  6. Makowski, A.M.: The bridge selection problem and the convergence properties of a learning algorithm – Stochastic approximations to the rescue (in preparation, 2008)

    Google Scholar 

  7. Gladyshev, E.G.: On stochastic approximation. Theory of Probabilities and Applications 10, 275–278 (1965)

    Article  Google Scholar 

  8. Robbins, H., Siegmund, D.: A convergence theorem for non-negative almost supermartingales and some applications. In: Rustagi, J.S. (ed.) Optimizing Methods in Statistics, pp. 233–257. Academic Press, New York (1972)

    Google Scholar 

  9. Pemantle, R.: A survey of random processes with reinforcement. Probability Surveys 4, 1–70 (2007)

    Article  MathSciNet  Google Scholar 

  10. Chung, K.L.: A Course in Probability Theory, 2nd edn. Academic Press, New York (1974)

    MATH  Google Scholar 

  11. Hall, P., Heyde, C.C.: Martingale Limit Theory and Its Applications, Probability and Mathematical Statistics. Academic Press, New York (1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marco Dorigo Mauro Birattari Christian Blum Maurice Clerc Thomas Stützle Alan F. T. Winfield

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Makowski, A.M. (2008). The Binary Bridge Selection Problem: Stochastic Approximations and the Convergence of a Learning Algorithm. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., Stützle, T., Winfield, A.F.T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2008. Lecture Notes in Computer Science, vol 5217. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87527-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87527-7_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87526-0

  • Online ISBN: 978-3-540-87527-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics