We develop a hybrid algorithm using Genetic Algorithms (GA) and Simulated Annealing (SA) to solve multi-objective step function maximization problems. We then apply the algorithm to a specific economic problem which is taken out of the corporate governance literature.

Financial data sets are growing too fast and need to be analyzed. Data science has many different techniques to store and summarize, mining, running simulations and finally analyzing them. Among data science methods, predictive methods play a critical role in analyzing financial data sets. In...

The creation of the European Monetary Union has led to a substantial increase in the discussion of the importance of fiscal discipline and adequate fiscal rules in such a monetary union. The “European” solution has been challenged by many authors and politicians: among the main questions...

We develop a hybrid algorithm using Genetic Algorithms (GA) and Simulated Annealing (SA) to solve multi-objective step function maximization problems. We then apply the algorithm to a specific economic problem which is taken out of the corporate governance literature.

A problem posed by O. L. Deutsch (Deutsch, O. L. 1988. Artificial intelligence design challenge---Background, analysis, and relative performance of algorithms. J. Guidance, Control, and Dynamics 11 386--393.) as the Artificial Intelligence Design Challenge for the 1987 American Institute of...

The bundling sale of information products has been a prevalent strategy in information industries. This paper attempts to study two issues that have not been adequately addressed in previous researches. First, we define the measure of customer heterogeneity by considering both the statistic...

Three computational techniques for approximation of counterparty exposure for financial derivatives are presented. The exposure can be used to quantify so-called Credit Valuation Adjustment (CVA) and Potential Future Exposure (PFE), which are of utmost importance for modern risk management in...

In this paper we present an algorithm to estimate the Hausdorff fractal dimension. The algorithm uses a recursive formula with a fast enough convergence. The accuracy of results is independent on the size, i.e., degree of definition of the fractal set. This fact is particularly useful when...