Skip to main content
SpringerLink
Log in

A Complexity Based Feature to Support Emergence in MAS

  • Conference paper
Multi-Agent Systems and Applications IV (CEEMAS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3690))

Abstract

Emergence is a widespread notion in complex systems, artificial life and multi-agent systems. In this paper, we try to clarify a specific emergence feature suggested by John Holland [1] : the “much from little” paradigm . Considering complexity measures, we exhibit some key issues for a precise definition of this feature. Seen from the Vowels multi-agent perspective [2], our proposal might provide an indirect quantification of dynamic collective activity.

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

Access this chapter

Log in via an institution
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

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. Holland, J.H.: Emergence: From Chaos to Order. Perseus Books (1997)

    Google Scholar 

  2. Demazeau, Y.: Steps towards multi-agent oriented programming. In: 1st International Workshop on Multi Agent Systems (1997)

    Google Scholar 

  3. Ronald, E., Sipper, M., Capcarrère, M.: Design, observation, surprise! a test of emergence. In: Artificial Life 5, pp. 225–239 (1999)

    Google Scholar 

  4. Darley, V.: Emergent phenomena and complexity. In: Brooks, R., Maes, P. (eds.) Artificial Life 4, pp. 411–416 (1994)

    Google Scholar 

  5. Leibniz, G.W.: Discours de métaphysique. Vrin (1686)

    Google Scholar 

  6. Chaitin, G.: A theory of program size formally identical to information theory. Journal of the ACM (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire Leibniz, 46 avenue Félix Viallet, Grenoble, France

    Joris Deguet & Yves Demazeau

Authors
  1. Joris Deguet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yves Demazeau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Cybernetics, Czech Technical University in Prague, Czech Republic

    Michael Pěchouček

  2. Austrian Research Institute for Artificial Intelligence, Freyung 6/6, A-1010, Vienna, Austria

    Paolo Petta

  3. Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende u. 13-17., 1111, Budapest, Hungary

    László Zsolt Varga

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deguet, J., Demazeau, Y. (2005). A Complexity Based Feature to Support Emergence in MAS. In: Pěchouček, M., Petta, P., Varga, L.Z. (eds) Multi-Agent Systems and Applications IV. CEEMAS 2005. Lecture Notes in Computer Science(), vol 3690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11559221_74

Download citation

  • DOI: https://doi.org/10.1007/11559221_74

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29046-9

  • Online ISBN: 978-3-540-31731-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation