Opponent modeling in a PGM framework

Nicolaj Søndberg-Jeppesen, Finn Verner Jensen, Yifeng Zeng

    Research output: Contribution to conferencePaper

    8 Downloads (Pure)

    Abstract

    We consider the situation where two agents try to solve their own task in a common environment. In particular, we study a type of sequential Bayesian games with unlimited time horizon where two players share a visible scene, but the tasks (termed assignments) of the players are private information. We present a probabilistic graphical model (PGM), together with recursive modeling techniques, for representing this type of games. We introduce the type tree which can be used to calculate policies and to efficiently approximate the opponent’s state of belief. Secondly, we propose a method for reasoning with a mixture of models when a true model of opponent agents is unknown in the game due to their private information. We demonstrate its performance in a Grid game.
    Original languageEnglish
    Number of pages8
    Publication statusPublished - 2013
    Event2013 International Conference on Autonomous Agents and Multi-agent Systems - St. Paul, United States
    Duration: 6 May 201310 May 2013
    Conference number: 13

    Conference

    Conference2013 International Conference on Autonomous Agents and Multi-agent Systems
    Abbreviated titleAAMAS '13
    CountryUnited States
    CitySt. Paul
    Period6/05/1310/05/13

    Bibliographical note

    ACM allows authors' version of their own ACM-copyrighted work on their personal server or on severs belonging to their employers. For full details see http://www.acm.org/publications/policies/RightsResponsibilities [Accessed 27/01/2016]

    Cite this

    Søndberg-Jeppesen, N., Verner Jensen, F., & Zeng, Y. (2013). Opponent modeling in a PGM framework. Paper presented at 2013 International Conference on Autonomous Agents and Multi-agent Systems , St. Paul, United States.