Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 70 tok/s
Gemini 2.5 Pro 42 tok/s Pro
GPT-5 Medium 30 tok/s Pro
GPT-5 High 34 tok/s Pro
GPT-4o 111 tok/s Pro
Kimi K2 202 tok/s Pro
GPT OSS 120B 452 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Optimal Trading with Linear Costs (1203.5957v1)

Published 27 Mar 2012 in q-fin.PM

Abstract: We consider the problem of the optimal trading strategy in the presence of linear costs, and with a strict cap on the allowed position in the market. Using BeLLMan's backward recursion method, we show that the optimal strategy is to switch between the maximum allowed long position and the maximum allowed short position, whenever the predictor exceeds a threshold value, for which we establish an exact equation. This equation can be solved explicitely in the case of a discrete Ornstein-Uhlenbeck predictor. We discuss in detail the dependence of this threshold value on the transaction costs. Finally, we establish a strong connection between our problem and the case of a quadratic risk penalty, where our threshold becomes the size of the optimal non-trading band.

Citations (30)

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube