Chaotic time series prediction for the game, Rock-Paper-Scissors

  • Authors:
  • Franco Salvetti;Paolo Patelli;Simone Nicolo

  • Affiliations:
  • Department of Computer Science, University of Colorado at Boulder, 430 UCB, Boulder, CO 80309-0430, USA;T-13 Complex System Group, Theoretical Division, CNLS Los Alamos National Laboratory, Mail Stop B-213, Los Alamos, NM 87545, USA;Department of Computer Science, University of Colorado at Boulder, 430 UCB, Boulder, CO 80309-0430, USA

  • Venue:
  • Applied Soft Computing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Two players of Rock-Paper-Scissors are modeled as adaptive agents which use a reinforcement learning algorithm and exhibit chaotic behavior in terms of trajectories of probability in mixed strategies space. This paper demonstrates that an external super-agent can exploit the behavior of the other players to predict favorable moments to play against one of the other players the symbol suggested by a sub-optimal strategy. This third agent does not affect the learning process of the other two players, whose only goal is to beat each other. The choice of the best moment to play is based on a threshold associated with the Local Lyapunov Exponent or the Entropy, each computed by using the time series of symbols played by one of the other players. A method for automatically adapting such a threshold is presented and evaluated. The results show that these techniques can be used effectively by a super-agent in a game involving adaptive agents that exhibit collective chaotic behavior.