Optimal buy-and-hold strategies for financial markets with bounded daily returns

Gen Huey Chen*, Ming Yang Kao, Yuh Dauh Lyuu, Hsing Kuo Wong

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

8 Scopus citations

Abstract

A general solution is presented for any finite request-answer game to derive its optimal competitive ratio and optimal randomized on-line algorithm against the oblivious adversary. The solution is based on game theory. We then apply the framework to the practical buy-and-hold trading problem and find the exact optimal competitive ratio and an optimal randomized on-line algorithm. We also prove the uniqueness of the solution.

Original languageEnglish (US)
Pages (from-to)119-128
Number of pages10
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs
StatePublished - 1999
EventProceedings of the 1999 31st Annual ACM Symposium on Theory of Computing - FCRC '99 - Atlanta, GA, USA
Duration: May 1 1999May 4 1999

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Optimal buy-and-hold strategies for financial markets with bounded daily returns'. Together they form a unique fingerprint.

Cite this