Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE ( © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 04 December 2020

Abstract and Keywords

This chapter focuses on genetic programming (GP), a stochastic optimization and model induction technique. An advantage of GP is that the modeler need not select the exact parameters to be used in the model beforehand. Rather, GP can effectively search a complex model space defined by a set of building blocks specified by the modeler. This flexibility has allowed GP to be used for many applications. The chapter reviews some of the most significant developments using GP: forecasting, stock selection, derivative pricing and trading, bankruptcy and credit risk assessment, and agent-based and economic modeling. Conclusions reached by studies investigating similar problems do not always agree; however, GP has proved useful across a wide range of problem areas. Recent and future work is increasingly concerned with adapting genetic programming to more dynamic environments and ensuring that solutions generalize robustly to out-of-sample data, to further improve model performance.

Keywords: genetic programming, evolutionary computation, trading rules, price forecasting, stock selection, derivatives pricing, agent-based modeling

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.