Modeling Maximum Trading Profits with C++: New Trading and Money Management Concepts - Softcover

Salov, Valerii

Softcover

ISBN 10: 0470086238 ISBN 13: 9780470086230

Publisher: Wiley, 2007

Synopsis

"Mr. Salov has taken one of my favorite creations – Perfect Profit – and provided an expanded description of his interpretation of it and put it in your hands with the included software. Like I said fifteen years ago, Perfect Profit is an important tool for the trading system developer. See for yourself."
—Robert Pardo, President, Pardo Capital Limited

"A very in-depth reference for programmers that should serve well into the future. The code herein lends itself well to other syntactically similar programming languages such as Java, PHP, and C#."
—Ralph Vince

The goal of trading is to make money, and for many, profits are the best way to measure that success. Author Valerii Salov knows how to calculate potential profit, and in Modeling Maximum Trading Profits with C++, he outlines an original and thought-provoking approach to trading that will help you do the same.

This detailed guide will show you how to effectively calculate the potential profit in a market under conditions of variable transaction costs, and provide you with the tools needed to compute those values from real prices. You'll be introduced to new notions of s-function, s-matrix, s-interval, and polarities of s-intervals, and discover how they can be used to build the r- and l-algorithms as well as the first and second profit and loss reserve algorithms. Optimal money management techniques are also illustrated throughout the book, so you can make the most informed trading decisions possible.

Filled with in-depth insight and expert advice, Modeling Maximum Trading Profits with C++ contains a comprehensive overview of trading, money management, and C++. A companion website is also included to help you test the concepts described throughout the book before you attempt to use them in real-world situations.

About this title

From the Back Cover:

"A very in-depth reference for programmers that should serve well into the future. The code herein lends itself well to other syntactically similar programming languages such as Java, PHP, and C#."
—Ralph Vince

The goal of trading is to make money, and for many, profits are the best way to measure that success. Author Valerii Salov knows how to calculate potential profit, and in Modeling Maximum Trading Profits with C++, he outlines an original and thought-provoking approach to trading that will help you do the same.

This detailed guide will show you how to effectively calculate the potential profit in a market under conditions of variable transaction costs, and provide you with the tools needed to compute those values from real prices. You'll be introduced to new notions of s-function, s-matrix, s-interval, and polarities of s-intervals, and discover how they can be used to build the r- and l-algorithms as well as the first and second profit and loss reserve algorithms. Optimal money management techniques are also illustrated throughout the book, so you can make the most informed trading decisions possible.

Filled with in-depth insight and expert advice, Modeling Maximum Trading Profits with C++ contains a comprehensive overview of trading, money management, and C++. A companion website is also included to help you test the concepts described throughout the book before you attempt to use them in real-world situations.

About the Author:

VALERII SALOV, PHD, is Vice President and Director of Financial Product Development for Toolkit at NumeriX LLC, a firm that provides software solutions for the pricing and management of derivatives. Previously, Salov worked at Merrill Lynch, where he helped develop automated systems for trading futures, equities, and foreign exchange. He received a PhD in analytical chemistry from the Russian Academy of Sciences.

About this edition

• Publisher: Wiley
• Publication date: 2007
• ISBN 10: 0470086238
• ISBN 13: 9780470086230
• Binding: Paperback
• Edition number: 1
• Number of pages: 264