Stock Market Trading Via Stochastic Network Optimization

Michael J. Neely

Papers from arXiv.org

Abstract: We consider the problem of dynamic buying and selling of shares from a collection of $N$ stocks with random price fluctuations. To limit investment risk, we place an upper bound on the total number of shares kept at any time. Assuming that prices evolve according to an ergodic process with a mild decaying memory property, and assuming constraints on the total number of shares that can be bought and sold at any time, we develop a trading policy that comes arbitrarily close to achieving the profit of an ideal policy that has perfect knowledge of future events. Proximity to the optimal profit comes with a corresponding tradeoff in the maximum required stock level and in the timescales associated with convergence. We then consider arbitrary (possibly non-ergodic) price processes, and show that the same algorithm comes close to the profit of a frame based policy that can look a fixed number of slots into the future. Our analysis uses techniques of Lyapunov Optimization that we originally developed for stochastic network optimization problems.

Date: 2009-09
New Economics Papers: this item is included in nep-fmk
References: Add references at CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/0909.3891 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:0909.3891

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().