Abstract
An algorithm was developed and implemented to find controllers from the stock shares for some financial institutions for the Brazilian Central Bank (BCB). The original problem is similar to a typical Sum of Subset problem that is suggested to be solved by a backtracking algorithm and the problem complexity is NP-complete. Usually BCB solves this problem manually which is time consuming and prone to errors. The heuristical approximation algorithm presented in this paper has polynomial complexity O(n3) and is based on sub-routines for determining controllers at the first two levels. The paper describes the basic concepts and business rules currently employed in BCB, our algorithm and its major subroutines, it gives a brief complexity analysis and an example illustration at level 2. Our experimental results indicate the feasibility of an automation of the process of finding controllers. Though developed for BCB, our algorithm works equally well for other financial institutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Banco Central do Brasil: Regras para se calcular o controlador de uma entidade supervisionada pelo Banco Central do Brasil, (2001).
Cormen, T. H., Leiserson, C. E.and Rivest, R. L.: Introduction to Algorithms, The MIT Press, Combridge, USA, (1996).
Horowitz, E., Sahni, S. and Rajasekaran, S.: Computer Algorithms, Computer Science Press, New York, USA, (1998).
Garey, M. R., and Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company (1979).
Brickell, E. F.: Solving low density knapsacks, Advances in Cryptology, Proceedings of Crypto’ 83, Plenum Press, New York (1984), 25–37.
Lagarias, J. C., and Odlyzko, A. M.: Solving low-density subset sum problems, J. Assoc. Comp. Mach. 32(1) (1985), 229–246.
Radziszowski, S. and Kreher, D.: Solving subset sum problems with the L 3 algorithm, J. Combin. Math. Combin. Comput. 3 (1988), 49–63.
Branco, V. G. F., Weigang, L., Ribeiro, A. F., Shibata, W., Abad, M. P. E., Torres, N. V., Dib, M. V. P. and de Andrade, V. M.: An Algorithm for Determining the Controllers of Supervised Entities at the First Level: Brazilian Central Bank Case Study, Proc. of FSKD’02-1st International Conference on Fuzzy Systems and Knowledge Discovery, pp. 240–244, Singapore, (2002).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Branco, V.G.F., Weigang, L., Abad, M.P.E., Denzinger, J. (2003). An Algorithm for Determining the Controllers of Supervised Entities at the First and Second Levels: A Case Study with the Brazilian Central Bank. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44842-X_16
Download citation
DOI: https://doi.org/10.1007/3-540-44842-X_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40156-8
Online ISBN: 978-3-540-44842-6
eBook Packages: Springer Book Archive