Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Design of financial CDO squared transactions using constraint programming
Flener P., Pearson J., Reyna L., Sivertsson O. Constraints12 (2):179-205,2007.Type:Article
Date Reviewed: Jan 7 2008

A specific problem in financial optimal design is addressed in this paper: the construction of collateralized debt obligation (CDO) transactions with minimum overlapping between two tranches. A CDO is divided into tranches, each consisting of a subset of the underlying credit derivatives. Minimizing overlap between two tranches maximizes diversification so that investors can spread their risks or choose the preferred level of risk.

In the most general form, the problem is stated as a generalization of the balanced incomplete block design (BIBD), also arising in combinatorial design theory. In Section 3, the authors suggest the use of constraint programming for solving small or medium instances of this problem. In Section 4, they present a heuristic procedure for the larger instances arising in financial applications.

The paper is clearly written—even a user that is not an expert in financial applications will be able to read it with no particular difficulties; various examples are included. The computational experiments on large instances are limited, and the paper lacks a comparison with other possible approaches, such as integer programming. Section 2.3 on BIBDs is also extremely interesting.

As reported in the final section of the paper, the proposed strategy has eliminated the need for ad hoc manual permutations when designing CDO squared transactions. From a more general point of view, it would be interesting to include as a criterion not only the number of overlapping derivatives, but also some measure of risk.

Reviewer:  Renato De Leone Review #: CR135082 (0811-1098)
Bookmark and Share
 
Logic And Constraint Programming (F.4.1 ... )
 
 
Constrained Optimization (G.1.6 ... )
 
 
Nonnumerical Algorithms And Problems (F.2.2 )
 
Would you recommend this review?
yes
no
Other reviews under "Logic And Constraint Programming": Date
Negation by default and unstratifiable logic programs
Bidoit N., Froidevaux C. Theoretical Computer Science 78(1): 85-112, 1991. Type: Article
Feb 1 1992
Programming in three-valued logic
Delahaye J. (ed), Thibau V. Theoretical Computer Science 78(1): 189-216, 1991. Type: Article
Jan 1 1992
Essentials of logic programming
Hogger C., Oxford University Press, Inc., New York, NY, 1990. Type: Book (9780198538325)
Sep 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy