Genetic Programming for the Acquisition of Double Auction Market Strategies   [GP]

by

Andrews, M. and Prager, R.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Advances in Genetic Programming, 1994, p. 355-368
Keywords:genetic algorithms, genetic programming
Notes:
" a GP approach was very successful in learning strategies for playing a simple game with complex dynamics" Ref Knobeln Contest: Sanfrancisco.ira.uka.de [129.13.13.110] /pub/knobeln Generational GP pop=300, touranment selection? size=2? Comparison with Simulated Annealing:SA also good but GP better Best GP exceeded performance of handcode routines (on average?) 65% of time. Check details of what exctly this means. Set number of games played so could distinquish meadian from top quartile with 95% confidence. Claims it helps, but doesnt seem to have either speeded things at lot or made much better result.
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@InCollection{kinnear:andrews,
  author =       "Martin Andrews and Richard Prager",
  title =        "Genetic Programming for the Acquisition of Double
                 Auction Market Strategies",
  booktitle =    "Advances in Genetic Programming",
  publisher =    "MIT Press",
  editor =       "Kenneth E. {Kinnear, Jr.}",
  year =         "1994",
  chapter =      "16",
  size =         "14 pages",
  keywords =     "genetic algorithms, genetic programming",
  pages =        "355--368",
  notes =        "{"} a GP approach was very successful in learning
                 strategies for playing a simple game with complex
                 dynamics{"} Ref Knobeln Contest:
                 Sanfrancisco.ira.uka.de [129.13.13.110]
                 /pub/knobeln

                 Generational GP pop=300, touranment selection? size=2?
                 Comparison with Simulated Annealing:SA also good but GP
                 better Best GP exceeded performance of handcode
                 routines (on average?) 65% of time. Check details of
                 what exctly this means.

                 Set number of games played so could distinquish meadian
                 from top quartile with 95% confidence. Claims it helps,
                 but doesnt seem to have either speeded things at lot or
                 made much better result.

                 ",
}