ACM Home Page
Please provide us with feedback. Feedback
Effective tag mechanisms for evolving cooperation
Full text PdfPdf (297 KB)
Source
International Conference on Autonomous Agents archive
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 table of contents
Budapest, Hungary
SESSION: Multi-agent based simulation/emergent behaviour table of contents
Pages 489-496  
Year of Publication: 2009
ISBN:978-0-9817381-6-1
Authors
Matt Matlock  University of Tulsa
Sandip Sen  University of Tulsa
Sponsors
: The Foundation for Intelligent Physical Agents
Microsoft Research : Microsoft Research
: Wiley - Blackwell Ltd
: Whitestein Technologies
: European Office of Aerospace Research and Development, Air Force Office of Scientific Research, United States Air Force Research Laboratory
: Drexel University
Publisher
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 33,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Certain observable features (tags), shared by a group of similar agents, can be used to signal intentions and can be effectively used to infer unobservable properties. Such inference will enable the formulation of appropriate behaviors for interaction with those agents. Tags have been previously shown to be successful in social dilemma situations such as the prisoner's dilemma, and more recently have been shown to be applicable to other games by augmenting the standard tag mechanisms. We examine these more general tag mechanisms, and explain previously reported results by more thoroughly examining their fundamental designs. We show that these new tag mechanisms, along with some adjustments and augmentations, can be effective in enabling stable, socially optimal, and fair cooperative outcomes to emerge in general sum games. We focus, in particular, on general-sum conflicted games, where socially optimal outcomes do not necessarily yield the best results for individual agents. We argue that the improvements and understanding of these mechanisms expands the usability of tag mechanisms for facilitating coordination in multiagent systems. We argue that they allow agents to effectively reuse knowledge learned form interactions with one agent when interacting with other agents sharing the same features.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R. Axelrod. The complexity of cooperation: Agent-based models of conflict and cooperation. Princeton University Press, Princeton, NJ, 1997.
 
2
J. Bendor and P. Swistak. The evolutionary stability of cooperation. American Political Science Review, 91(2):290--307, June 1997.
 
3
S. J. Brams. Theory of Moves. Cambridge University Press, Cambridge: UK, 1994.
4
 
5
 
6
C. M. Judd and B. Park. Definition and assessment of accuracy in social stereotypes. Psychological Review, 100(1):109--128, Jan 1993.
7
 
8
A. McDonald and S. Sen. The success and failure of tag-mediated evolution of cooperation. In K. Tuyls, P. J. Hoen, K. Verbeeck, and S. Sen, editors, LAMAS, volume 3898 of Lecture Notes in Computer Science, pages 155--164. Springer, 2005.
 
9
R. B. Myerson. Game Theory: Analysis of Conflict. Harvard University Press, 1991.
 
10
 
11
R. Riolo. The effects and evolution of tag-mediated selection of partners in populations playing the Iterated Prisoner's Dilemma. In Proceedings of the Seventh International Conference on Genetic Algorithms, pages 378--385. Morgan Kaufmann Publishers, Inc., 1997.
 
12
R. Riolo, M. D. Cohen, and R. Axelrod. Cooperation without reciprocity. Nature, 414:441--443, 2001.
 
13

Collaborative Colleagues:
Matt Matlock: colleagues
Sandip Sen: colleagues