Robust Game Play Against Unknown Opponents

Nathan Sturtevant and Michael Bowling. Robust Game Play Against Unknown Opponents. In Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 713–719, 2006.

Download

[PDF] 

Abstract

A standard assumption of search in two-player games is that the opponent has the same evaluation function or utility for possible game outcomes. While some work has been done to try to better exploit weak opponents, it has only been a minor component of high-performance game playing programs such as Chinook or Deep Blue. However, we demonstrate that in games with more than two players, opponent modeling is a necessary component for ensuring high-quality play against unknown opponents. Thus, we propose a new algorithm, soft-maxn, which can help accommodate differences in opponent styles. Finally, we show an inference mechanism that can be used with soft-maxn to infer the playing style of our opponents.

BibTeX

@InProceedings(06aamas-softmaxn,
  Author = "Nathan Sturtevant and Michael Bowling",
  Title = "Robust Game Play Against Unknown Opponents",
  Booktitle = "Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS)",
  Year = "2006",
  pages = "713--719",
  AcceptRate = "23\%",
  AcceptNumbers = "127 of 550"
)

Generated by bib2html.pl (written by Patrick Riley) on Fri Feb 13, 2015 15:54:29