<?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>Policy Recognition for Multi-Player Tactical Scenarios</article-title>
</title-group>

<author><a href="mailto:gitars@cs.cmu.edu"><name>Gita Sukthankar</name></a></author>
<aff>Robotics Institute Carnegie <br/>Mellon University 5000 Forbes Ave. Pittsburgh, PA</aff>

<author><a href="mailto:katia+@cs.cmu.edu"><name>Katia Sycara</name></a></author>
<aff>Robotics Institute Carnegie <br/>Mellon University 5000 Forbes Ave. Pittsburgh, PA</aff>
</article-meta></front>
<body>
<abstract>
<title>ABSTRACT</title>
<p>This paper addresses the problem of recognizing policies
given logs of battle scenarios from multi-player games. The
ability to identify individual and team policies from observations
is important for a wide range of applications including
automated commentary generation, game coaching, and opponent
modeling. We define a <italic>policy</italic> as a preference model
over possible actions based on the game state, and a <italic>team
policy</italic> as a collection of individual policies along with an
assignment of players to policies. This paper explores two
promising approaches for policy recognition: (1) a modelbased
system for combining evidence from observed events
using Dempster-Shafer theory, and (2) a data-driven discriminative
classifier using support vector machines (SVMs).
We evaluate our techniques on logs of real and simulated
games played using Open Gaming Foundation d20, the rule
system used by many popular tabletop games, including
Dungeons and Dragons.</p>
</abstract>
<fpdf>
<href>pdflogo.jpg</href>
<hpdf>AAMAS07_0058_31a0507b800688227ba06987973745c5</hpdf>
</fpdf>
</body>
</article>

