Many situations involving strategic interaction between agents involve a continuos set of choices. Therefore it is natural to model these problems using continuous space games. Consequently the population of agents playing the game will be represented with a density function defined over the continuous set of strategy choices.
Simulating evolution of this population is a challenging problem. We present a method for simulating replicator dynamics in continuos space games using sequential Monte Carlo methods. The particle approach to density estimation provides a computationally efficient way of modeling the evolution of probability density functions.
Finally a resampling step and smoothing methods are used to prevent particle degeneration problem associated with particle estimates. Finally we compare and contrast the resulting algorithm for simulation with genetic programming techniques.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.