Abstract

 
 

Citations



 


 



Satisficing Measures for Analysis of Risky Positions


David B. Brown


Duke University - Decision Sciences

Melvyn Sim


NUS Business School, National University of Singapore

February 8, 2008


Abstract:     
In this work we introduce a class of measures for evaluating the quality of financial positions based on their ability to achieve desired financial goals. In the spirit of Simon (1959), we call these measures satisficing measures and show that they are dual to classes of risk measures. This approach has the advantage that aspiration levels, either competing benchmarks or fixed targets, are often much more natural to specify than risk tolerance parameters. In addition, we propose a class of satisficing measures that reward diversification. Finding optimal portfolios for such satisficing measures is computationally tractable. Moreover, this class of satisficing measures has an ambiguity interpretation in terms of robust guarantees on the expected performance as the underlying distribution deviates from the investor's reference distribution. Finally, we show some promising results for our approach compared to traditional methods in a real-world portfolio problem against a competing benchmark.

Keywords: satisficing, aspiration levels, risk measures, coherent risk measures, convex risk measures, targets, portfolio optimization

working papers series


Date posted: June 22, 2007 ; Last revised: September 21, 2008

Suggested Citation

Brown, David B. and Sim, Melvyn, Satisficing Measures for Analysis of Risky Positions (February 8, 2008). Available at SSRN: http://ssrn.com/abstract=993307

Contact Information

David B. Brown (Contact Author)
Duke University - Decision Sciences ( email )
Durham, NC 27708-0120
United States
Melvyn Sim
NUS Business School, National University of Singapore ( email )
1 Business Link
Singapore, 117592
Singapore
Feedback to SSRN (Beta)


Paper statistics
Abstract Views: 525

© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright
This page was processed by apollo1 in 1.328 seconds