Abstract
Previous work by other researchers has investigated the evolution and stability of a ‘probabilistic reciprocity’ strategy in a package delivery domain where all agents could communicate reputations to every other agent. We extend that work to the more realistic situation of spatially distributed agents with neighborhoods that restrict agent interaction and communication. We improve the original probabilistic reciprocity strategy with a modification that tarnishes the reputations of agents that repeatedly refuse requests for help. We then investigate the effect of reducing neighborhood size from the general case of the ‘global neighborhood’ used in previous work. Our experiments show that neighborhoods can be reduced to a critical size without a significant degradation in the evolutionary stability of the improved probabilistic reciprocity strategy. We also show that locating like agents within a niche can mitigate this degradation. From a multi-agent design perspective, this means that for a population with a given proportion of selfish and dishonest agents, communication may be reduced to within a subset of the population while retaining the same success of the reciprocative strategy. We also show how to extend the problem domain to abstract a wider range of interaction situations as defined in the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ferber, J.: Multi-Agent Systems: An Introduction to Distributed Artificial Intelligence. Addison-Wesley, London (1999)
Maes, P.: Agents That Reduce Work and Information Overload. Communications of the ACM 37, 31–40 (1994)
Wooldridge, M., Jennings, N.: Intelligent Agents: Theory and Practice. Knowledge Engineering Review 10, 115–152 (1995)
Weiss, G.: Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence. M.I.T. Press, Cambridge (2000)
Bellifemine, F., Poggi, A., Rimassa, G.: JADE - A FIPA-compliant agent framework. In: Proceedings of the 4th International Conference on the Practical Applications of Agents and Multi-Agent Systems (PAAM 1999), pp. 99–108 (1999)
Gasparetti, F., Micarelli, A.: Adaptive web search based on a colony of cooperative distributed agents. In: Klusch, M., Omicini, A., Ossowski, S., Laamanen, H. (eds.) CIA 2003. LNCS (LNAI), vol. 2782, pp. 168–183. Springer, Heidelberg (2003)
Steels, L.: Cooperation between distributed agents through self-organisation. In: Demazeau, Y., Mueller, J.P. (eds.) Decentralized AI - Proceedings of the First European Workshop on Modelling Autonomous Agents in a Multi-Agent World (MAAMAW 1989), pp. 175–196. Elsevier Science, Amsterdam (1990)
Sen, S., Dutta, P.S.: The Evolution and Stability of Cooperative Traits. In: Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1114–1120. ACM Press, New York (2002)
Sen, S.: Reciprocity: a foundational principle for promoting cooperative behavior among self-interested agents. In: Proceedings of the Second International Conference on Multiagent Systems, pp. 322–329. AAAI Press, Menlo Park (1996)
Lyons, G.J., Madden, M.G., Smith, F., Chambers, D.: Virtual Logistics Multi- Agent Broker. In: Research Proposal to the Enterprise Ireland Informatics Research Initiative (2003)
Axelrod, R.M.: Effective Choice in the Prisoner’s Dilemma. The Journal of Conflict Resolution 24, 3–25 (1980)
Axelrod, R.M.: The Evolution of Cooperation. Basic Books, New York (1984)
Axelrod, R.M.: More Effective Choice in the Prisoner’s Dilemma. The Journal of Conflict Resolution 24, 379–403 (1980)
Rapoport, A.: Prisoner’s Dilemma. In: Eatwell, J., Milgate, M., Newman, P. (eds.) The New Palgrave: Game Theory, pp. 199–204. Macmillan, London (1989)
Binmore, K.: The Complexity of Cooperation by Robert Axelrod, a long review by Ken Binmore. Journal of Artificial Societies and Social Simulation 1 (1998)
Nowak, M.A., Sigmund, K.: A strategy of win-stay, lose-shift that outperforms tit-for-tat in the prisoners dilemma game. Nature 364, 56–58 (1993)
Epstein, J.M., Axtell, R.: Growing artificial societies: social science from the bottom up. Brookings Institution Press, Washington D.C (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ridge, E., Madden, M.G., Lyons, G.J. (2004). The Evolution of Probabilistic Reciprocity in a Multi-agent Environment with Neighborhoods. In: Klusch, M., Ossowski, S., Kashyap, V., Unland, R. (eds) Cooperative Information Agents VIII. CIA 2004. Lecture Notes in Computer Science(), vol 3191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30104-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-30104-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23170-7
Online ISBN: 978-3-540-30104-2
eBook Packages: Springer Book Archive