<?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>An Adaptive Strategy for Minority Games</article-title>
</title-group>

<author><a href="mailto:kmlam@cse.cuhk.edu.hk"><name>Ka-man Lam</name></a></author>
<aff>Department of Computer Science and Engineering<br/> The Chinese University of Hong Kong Shatin, Hong Kong, China</aff>

<author><a href="mailto:lhf@cse.cuhk.edu.hk"><name>Ho-fung Leung</name></a></author>
<aff>Department of Computer Science and Engineering<br/> The Chinese University of Hong Kong Shatin, Hong Kong, China</aff>

</article-meta></front>
<body>
<abstract>
<title>ABSTRACT</title>
<p>Many real life situations, like the financial market, auctions and resources competitions, can be modeled as Minority Games. In minority games, players choose to join one of the two sides, <italic>A</italic> or <italic>B</italic>. The players are rewarded if they have joined the minority side, and punished otherwise. A traditional way to play in the minority games is to use <italic>predictors</italic> to decide which side to join. A predictor predicts the winning side in the next time step given a history of winning sides in previous time steps. In this paper, we introduce <italic>Behavioral Predictors</italic> and <italic>Adaptive Strategies</italic> for the minority game, with which players perform much better than those using previous models.</p>
</abstract>
<fpdf>
<href>pdflogo.jpg</href>
<hpdf>AAMAS07_0061_fa03139b167d0ca2930161e3f0e91a33</hpdf>
</fpdf>
</body>
</article>
