Full metadata record
|dc.contributor.author||Hadji Misheva, Branka||-|
|dc.contributor.author||Kotlarz, Piotr Kamil||-|
|dc.description.abstract||The central research question to answer in this feasibility study is whether the Artificial Intelligence (AI) methodology of Self-Play can be applied to financial markets. In typical use-cases of Self-Play, two AI agents play against each other in a particular game, e.g. chess or Go. By repeatedly playing the game, they learn its rules as well as possible winning strategies. When considering financial markets, however, we usually have one player – the trader – that does not face one individual adversary but competes against a vast universe of other market participants. Furthermore, the optimal behaviour in financial markets is not described via a winning strategy, but via the objective of maximising profits while managing risks appropriately. Lastly, data issues cause additional challenges, since, in finance, they are quite often incomplete, noisy and difficult to obtain. We will show that academic research using Self-Play has mostly not focused on finance, and if it has, it was usually restricted to stock markets, not considering the large FX, commodities and bond markets. Despite those challenges, we see enormous potential of applying self-play concepts and algorithms to financial markets.||de_CH|
|dc.rights||Licence according to publishing contract||de_CH|
|dc.subject.ddc||006: Spezielle Computerverfahren||de_CH|
|dc.title||The applicability of self-play algorithms to trading and forecasting financial markets : a feasibility study||de_CH|
|dc.type||Working Paper – Gutachten – Studie||de_CH|
|zhaw.departement||School of Engineering||de_CH|
|zhaw.departement||School of Management and Law||de_CH|
|zhaw.organisationalunit||Institut für Datenanalyse und Prozessdesign (IDP)||de_CH|
|zhaw.organisationalunit||Institut für Wealth & Asset Management (IWA)||de_CH|
|Appears in collections:||Publikationen School of Management and Law|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.