Artificial Life and Robotics

, Volume 16, Issue 4, pp 563–566 | Cite as

A systemic payoff in a self-repairing network

Original Article

Abstract

Cooperation among agents is a crucial problem in autonomous distributed systems composed of selfish agents pursuing their own profits. An earlier study of a self-repairing network revealed that a systemic payoff was able to make the selfish agents cooperate with others. The systemic payoff is a payoff mechanism that sums up not only an agent’s own payoff, but also its neighborhood’s payoff. In the systemic payoff, the distance effect between the agents has not yet been studied. This article considers the systemic payoff that involves the distance effect among agents. We studied the effectiveness of the proposed mechanism for the network performance by multi-agent simulations.

Key words

Autonomous distributed systems Self-repairing network Selfish agents Kin selection Game theory 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Roughgarden T, Tardos E (2002) How bad is selfish routing? J ACM 49:236–259MathSciNetCrossRefGoogle Scholar
  2. 2.
    Koutsoupias E, Papadimitriou CH (2009) Worst-case equilibria. Comput Sci Rev 3:65–69CrossRefGoogle Scholar
  3. 3.
    Chen PA, Kempe D (2008) Altruism, selfishness, and spite in traffic routing. EC′08. Proceedings of the 9th ACM Conference on Electronic Commerce. ACM, New York, pp 140–149CrossRefGoogle Scholar
  4. 4.
    Azad AP, Altman E, Azouzi RE (2009) From altruism to noncooperation in routing games. Proceedings of the Networking and Electronic Commerce Research ConferenceGoogle Scholar
  5. 5.
    Ifti M, Killingback T, Doebeli M (2004) Effects of neighbourhood size and connectivity on the spatial continuous prisoner’s dilemma. J Theor Biol 231:97–106MathSciNetCrossRefGoogle Scholar
  6. 6.
    Oohashi M, Ishida Y (2007) Innovative algorithms and techniques in automation, industrial electronics and telecommunications. In: A game theoretic approach to regulating mutual repairing in a selfrepairing network. Springer, The Netherlands, pp 281–286Google Scholar
  7. 7.
    Ishida Y, Tokumitsu M (2008) Asymmetric interactions between cooperators and defectors for controlling self-repairing. Lecture Notes Comput Sci 5179:440–447CrossRefGoogle Scholar
  8. 8.
    Ishida Y (2005) A critical phenomenon in a self-repair network by mutual copying. Lecture Notes Comput Sci 3682:86–92CrossRefGoogle Scholar
  9. 9.
    Brembs B (2001) Hamilton’s theory. In: Encyclopedia of genetics. Academic Press, New York, pp 906–910CrossRefGoogle Scholar

Copyright information

© International Symposium on Artificial Life and Robotics (ISAROB). 2012

Authors and Affiliations

  1. 1.Department of Electronic and Information EngineeringToyohashi University of TechnologyTempaku, ToyohashiJapan
  2. 2.Department of Computer Science and EngineeringToyohashi University of TechnologyTempaku, ToyohashiJapan

Personalised recommendations