Skip to main content
SpringerLink
Log in

Loosely coupled distributed genetic algorithms

  • Conference paper
  • First Online:
Parallel Problem Solving from Nature — PPSN III (PPSN 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 866))

Included in the following conference series:

Abstract

Iterated, noncooperative N-person games with limited interaction are considered. Each player in the game has defined its local payoff function and a set of strategies. While each player acts to maximize its payoff, we are interested in a global behavior of the team of players measured by the average payoff received by the team. To study behavior of the system we propose a new parallel and distributed genetic algorithm based on evaluation of local fitness functions while the global criterion is optimized. We present results of simulation study which support our ideas.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Axelrod: The Evolution of Strategies in the Iterated Prisoners' Dilemma. In: L. Davis (ed.): Genetic Algorithms and Simulated Annealing. London: Pitman 1987

    Google Scholar 

  2. M. Dorigo, V. Maniezzo: Parallel Genetic Algorithms: Introduction and Overview of Current Research. In: J. Stender (ed.): Parallel Genetic Algorithms. IOS Press 1993

    Google Scholar 

  3. D.B. Fogel: Evolving Behaviors in the Iterated Prisoner's Dilemma. Evolutionary Computation, vol. 1. N 1 (1993)

    Google Scholar 

  4. M.R. Genesereth, M.L. Ginsberg, J.S. Rosenschein: Cooperation without Communication. In: A.H. Bond and Les Geser (eds.). Readings in Distributed Artificial Intelligence. Los Angeles 1988

    Google Scholar 

  5. D.E. Goldberg: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley. Reading. MA 1989

    Google Scholar 

  6. D.R. Hofstadter: Metamagical Themas: Questing for the Essence of Mind and Pattern. New York: Basic Books 1985

    Google Scholar 

  7. J.H. Holland: Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan: Press 1975

    Google Scholar 

  8. R. Levy, J.S. Rosenschein: A Game Theoretic Approach to Distributed Artificial Intelligence and the Pursuit Problem. In: E. Werner, Y. Demazeau (eds.): Decentralized A.I.-3. Elsevier 1992

    Google Scholar 

  9. B. Lomborg: Game Theory vs. Multiple Agents: the Iterated Prisoner's Dilemma. The 4-th European Workshop on Modeling of Autonomous Agents in a Multi-Agent Word (MAAMAW'92). S. Martino el Cimino Italy 1992

    Google Scholar 

  10. B. Manderick, P. Spiessens: Fine-Grained Parallel Genetic Algorithms. In: Proc. of the Third Int. Conf. on Genetic Algorithms 1989

    Google Scholar 

  11. H. Muhlenbein, M. Schomisch, J. Born: The Parallel Genetic Algorithms as Function Optimizer. In: Proc. of the Fourth International Conference on Genetic Algorithms 1991

    Google Scholar 

  12. J.F. Nash: Equilibrium Points in n-Person Games. Proc. of the National Academy of Sciences USA 36, pp. 48–49

    Google Scholar 

  13. P.C. Ordershook: Game Theory and Political Theory: an Introduction: Cambridge University Press 1986

    Google Scholar 

  14. C.B. Pettey, M.R. Lutze, J.J. Gretenstette: A Parallel Genetic Algorithm. Proc. of the Second Int. Conference on Genetic Algorithms 1987

    Google Scholar 

  15. A. Rapport: Optimal Policies for the Prisoner's Dilemma. Tech. Report N 50. The Psychometric Laboratory: Univ. of North Carolina 1966

    Google Scholar 

  16. F. Seredynski: Homogeneous Networks of Learning Automata. Tech. Report N 684. Institute of Computer Science PAS. Warsaw 1990

    Google Scholar 

  17. F. Seredynski: Dynamic Mapping and Load Balancing with Parallel Genetic Algorithms. IEEE World Congress on Computational Intelligence. Orlando. Florida. June 26–July 2 1994

    Google Scholar 

  18. M.L. Tsetlin: Automaton Theory and Modelling of Biological Systems. Academic Press. N.Y. 1973

    Google Scholar 

  19. V.I. Varshavski, A.M. Zabolotnyj, F. Seredynski: Homogeneous Games with a Conjugate Exchange Process. Proc. of the Academy of Science USSR Techniczeskaja Kibernetika. N 6 (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Polish Academy of Sciences, ul. Ordona 21, 01-237, Warsaw, Poland

    Franciszek Seredynski

Authors
  1. Franciszek Seredynski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Yuval Davidor Hans-Paul Schwefel Reinhard Männer

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seredynski, F. (1994). Loosely coupled distributed genetic algorithms. In: Davidor, Y., Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature — PPSN III. PPSN 1994. Lecture Notes in Computer Science, vol 866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58484-6_294

Download citation

  • DOI: https://doi.org/10.1007/3-540-58484-6_294

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58484-1

  • Online ISBN: 978-3-540-49001-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation