• DocumentCode
    2217564
  • Title

    Adaptive opponent modelling for the iterated prisoner´s dilemma

  • Author

    Piccolo, Elio ; Squillero, Giovanni

  • Author_Institution
    Politec. di Torino, Torino, Italy
  • fYear
    2011
  • fDate
    5-8 June 2011
  • Firstpage
    836
  • Lastpage
    841
  • Abstract
    This paper describes the design of Laran, an intelligent player for the iterated prisoner´s dilemma. Laran is based on an evolutionary algorithm, but instead of using evolution as a mean to define a suitable strategy, it uses evolution to model the behavior of its adversary. In some sense, it understands its opponent, and then exploits such knowledge to devise the best possible conduct. The internal model of the opponent is continuously adapted during the game to match the actual outcome of the game, taking into consideration all played actions. Whether the model is correct, Laran is likely to gain constant advantages and eventually win. A prototype of the proposed approach was matched against twenty players implementing state-of-the art strategies. Results clearly demonstrated the claims.
  • Keywords
    evolutionary computation; game theory; iterative methods; Laran; adaptive opponent modelling; evolutionary algorithm; iterated prisoners dilemma; Adaptation models; Cloning; Computational modeling; Evolution (biology); Evolutionary computation; Game theory; Games; FSM; evolutionary algorithm; games; iterated prisoner´s dilemma;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation (CEC), 2011 IEEE Congress on
  • Conference_Location
    New Orleans, LA
  • ISSN
    Pending
  • Print_ISBN
    978-1-4244-7834-7
  • Type

    conf

  • DOI
    10.1109/CEC.2011.5949705
  • Filename
    5949705