Complex systems have provided not only an analytic view that computational intelligence could be attained at a critical point (edge of chaos) where a phase transition takes place, but also a synthetic view that computational intelligence could be embedded in the field where an open and evolutionary environment for sel.sh agents will lead to collective phenomena. In the synthetic view, using complex systems themselves for intelligent systems, such as DNA computing (we focus on immunity-based computing in another Chapter of this volume), grid computing, and parasitic computing, is another important paradigm.
This Chapter investigates the first step towards embedding computational intelligence in the Internet field by selfish agents, namely, whether selfish agents can ever cooperate and converge on some tasks. Selfish routing and task allocation have been studied extensively in the computational game community, but can intelligent tasks be done or can agents ever take care of themselves in the first place? We first pose the problem of self maintenance in an agent population, and then use a game theoretic approach to test whether cooperation would occur or under what conditions cooperation will occur.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akella A, Seshan S, Karp R, Shenker S, Papadimitriou C (2002) Selfish behavior and stability of the internet: a game theoretic analysis of TCP. In: Proc. ACM Annual Conf. of Speical Interest Group on Data Communications (SIGCOMM’02), August, Pittsburg, PA. ACM Press, New York, NY: 117-130.
Axelrod R (1984) The Evolution of Cooperation. Basic Books, New York, NY.
Barabasi A-L, Freeh VW, Jeong H, Brockman JB (2000) Parasitic computing. Nature, 412: 894-897.
Domany E, Kinzel W (1984) Equivalence of Cellular Automata to Ising Models and Directed Percolation. Phys. Rev. Lett. 53: 311
Dresher M(1961) The Mathematics of Games of Strategy: Theory and Applications. Prentice-Hall, Englewood Cliffs, NJ.
Feigenbaum J, Papadimitriou C, Shenker S (2001) Sharing the cost of multicast transmissions. J. Computer and System Sciences, 63: 21-41.
Feigenbaum J, Papadimitriou C, Sami R, Shenker S (2002) A bgp-based mecha-nism for lowest-cost routing. In: Proc. 21st ACM Symp. Principles of Distributed Computing (PODC’02), July, Monterey, CA, ACM Press, New York, NY: 173-182.
Feigenbaum J, Shenker S (2002) Distributed algorithmic mechanism design: recent results and future directions. In: Proc. 6th ACM Workshop Discrete Algorithms and Methods for Communication (Dial-M’02), 28 September, Atlanta, GA. ACM Press, New York, NY: 1-13.
Foster I, Kesselman C(eds) The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco, CA.
Hofbauer J, Sigmund K (2003) Evolutionary game dynamics. Bulletin American Mathematical Society, 40: 479-519.
Ishida Y (2005) A critical phenomenon in a self-repair network by mutual copying. In: Khosla R, Howlett RJ, Jain LC (eds.) Proc. 9th Knowledge-Based Intelligent Engineering Systems (KES 2005), Lecture Notes in Computer Science LNCS/LNAI 3682. Springer-Verlag, Berlin: 86-92.
Ishida Y (2006) A game theoretic analysis on incentive for cooperation in a self-repairing network. In: Elleithy K (ed.) Advances and Innovations in Systems, Computing Sciences and Software Engineering. Proc. Intl. Joint Conf. Com-puter, Information and Systems Sciences and Engineering (CIS2E 06), 4-14 December, Bridgeport, CT, Springer-Verlag, Berlin.
Ishida Y, Mori T (2005) Spatial strategies on a generalized spatial prisoner’s dilemma. J. Artificial Life and Robotics, 93: 139-143.
Ishida Y, Mori T (2005) A network self-repair by spatial strategies in spa-tial prisoner’s dilemma. In: Khosla R, Howlett RJ, Jain LC (eds.) Proc. 9th Knowledge-Based Intelligent Engineering Systems (KES 2005), Lecture Notes in Computer Science (LNCS/LNAI 3682), Springer-Verlag, Berlin: 79-85.
Koutsoupias E, Papadimitriou C (1999) Worst-case equilibria. In: Meinel C, Tison S (eds.) Lecture Notes in Computer Science LNCS1563: 404-413.
Lakshman TV, Kodialam M (2003) Detecting network intrusions via sampling: a game theoretic approach. In: Proc. 22nd Annual Joint Conf. IEEE Computer and Communications Societies (INFOCOM’03), 30 March - 3 April, San Francisco, CA. IEEE Press, Piscataway, NJ: 1880-1889.
Mavronikolas M, Spirakis P (2001) The price of selfish routing. In: Proc. 33rd Symp. Theory of Computing (STOC’01), 6-8 July, Hersonissos, Greece. ACM Press, New York, NY: 510-519.
Maynard-Smith J (1982) Evolution and the Theory of Games. Cambridge University Press, Cambridge, UK.
Nash J (1950) The bargaining problem. Econometrica, 18: 155-162.
Nisan N, Ronen A (2001) Algorithmic mechanism design. Games and Economic Behavior, 35: 166-196.
Nowak MA, May RM (1992) Evolutionary games and spatial chaos. Nature, 359: 826-829.
Oohashi M, Ishida Y (2007) A game theoretic approach to regulating mutual repairing in a self-repairing network. In: Sobh T, Elleithy K, Mahmood A, Karim M (eds.) Innovative Algorithms and Techniques in Automation, Industrial Electronics and Telecommunications. Springer-Verlag, Berlin: 281-286.
Papadimitriou C (2001) Algorithms, games, and the internet. In: Proc. 33rd Symp. Theory of Computing (STOC’01), 6-8 July, Hersonissos, Greece. ACM Press, New York, NY: 749-753.
Parkes D (1977) Iterative combinatorial auctions: achieving economic and com-putational efficiency. PhD Thesis, Department of Computer and Information Science, University of Pensylvania, PA.
Roughgarden T, Tardos E (2002) How bad is selfish routing? J. ACM, 492: 236-259.
Shooman ML(1968) Probabilistic Reliability: An Engineering Approach McGraw-Hill, New York, NY.
Shoham Y, Wellman M (1997) Economic principles of multi-agent systems. Artificial Intelligence, 94: 1-6.
Taylor PD, Jonker LB (1978) Evolutionarily stable strategies and game dynamics. Mathematical Bioscience, 40: 145-156.
Walsh W, Wellman M (1998) A market protocol for decentralized task alloca-tion. In: Proc. 3rd Intl. Conf. Multi-Agent Systems (ICMAS-98), July, France. IEEE Computer Society Press, Los Alamitos, CA: 325-332.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ishida, Y. (2008). Complex Systems Paradigms for Integrating Intelligent Systems: A Game Theoretic Approach. In: Fulcher, J., Jain, L.C. (eds) Computational Intelligence: A Compendium. Studies in Computational Intelligence, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78293-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-78293-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78292-6
Online ISBN: 978-3-540-78293-3
eBook Packages: EngineeringEngineering (R0)