<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet href="client.xsl" type="text/xsl"?>
<article article-type="other">
<front>
<journal-meta>
<journal-id/>
<issn/>
<banner>
<!--<href>banner.jpg</href>-->
<size width="100%"/>
</banner>
</journal-meta>
<article-meta>
<title-group>
<article-title>Effective Tag Mechanisms for Evolving Coordination</article-title>
</title-group>

<author><a href="mailto:matt-matlock@utulsa.edu"><name>Matthew Matlock</name></a></author>
<aff>Mathematical &#38; Computer Sciences Department <br/>University of Tulsa Tulsa, OKlahoma, USA</aff>

<author><a href="mailto:sandip@utulsa.edu"><name>Sandip Sen</name></a></author>
<aff>Mathematical &#38; Computer Sciences Department <br/>University of Tulsa Tulsa, OKlahoma, USA</aff>
</article-meta></front>
<body>
<abstract>
<title>ABSTRACT</title>
<p>Tags or observable features shared by a group of similar
agents are effectively used in real and artificial societies to
signal intentions and can be used to infer unobservable properties
and choose appropriate behaviors. Use of tags to select
partners has been shown to produce stable cooperation
in agent populations playing the Prisoner's Dilemma game.
Existing tag mechanisms, however, can promote cooperation
only if that requires identical actions from all group
members. We propose a more general tag-based interaction
scheme that facilitates and supports significantly richer
coordination between agents. Our work is motivated by previous
research that showed the ineffectiveness of current tag
schemes for solving games requiring divergent actions. The
mechanisms proposed here not only solves those problems
but are effective for other general-sum games. We argue
that these general-purpose tag mechanisms allow new application
possibilities of multiagent learning algorithms as
they allow an agent to reuse its learned knowledge about
one agent when interacting with other agents sharing the
same observable features.</p>
</abstract>
<fpdf>
<href>pdflogo.jpg</href>
<hpdf>AAMAS07_0183_80b5b876dfded843f6f994992ae44c74</hpdf>
</fpdf>
</body>
</article>

