• DocumentCode
    1573022
  • Title

    Opponent modeling with incremental active learning: A case study of Iterative Prisoner´s Dilemma

  • Author

    Hyunsoo Park ; Kyung-Joong Kim

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Sejong Univ., Seoul, South Korea
  • fYear
    2013
  • Firstpage
    1
  • Lastpage
    2
  • Abstract
    What´s the most important sources of information to guess the internal strategy of your opponents? The best way is to play games against them and infer their strategy from the experience. For novice players, they should play lot of games to identify other´s strategy successfully. However, experienced players usually play small number of games to model other´s strategy. The secret is that they intelligently design their plays to maximize the chance of discovering the most uncertain parts. Similarly, in this paper, we propose to use an incremental active learning for modeling opponents. It refines the other´s models incrementally by cycling “estimation (inference)“ and “exploration (playing games)” steps. Experimental results with Iterative Prisoner´s Dilemma games show that the proposed method can reveal other´s strategy successfully.
  • Keywords
    computer games; game theory; inference mechanisms; learning (artificial intelligence); estimation step; exploration step; incremental active learning; iterative prisoners dilemma game; opponent modeling; opponent strategy; Games; Genetic algorithms; Observers; Reverse engineering; Robots; Trajectory; estimation-exploration algorithm; game theory; iterative prisoner´s dilemma; theory of mind;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence in Games (CIG), 2013 IEEE Conference on
  • Conference_Location
    Niagara Falls, ON
  • ISSN
    2325-4270
  • Print_ISBN
    978-1-4673-5308-3
  • Type

    conf

  • DOI
    10.1109/CIG.2013.6633665
  • Filename
    6633665