Neural Networks in Bankruptcy Prediction - A Comparative Study on the Basis of the First Hungarian Bankruptcy Model

The article attempts to answer the question whether or not the latest bankruptcy prediction techniques are more reliable than traditional mathematical–statistical ones in Hungary. Simulation experiments carried out on the database of the first Hungarian bankruptcy prediction model clearly prove that bankruptcy models built using artificial neural networks have higher classification accuracy than models created in the 1990s based on discriminant analysis and logistic regression analysis. The article presents the main results, analyses the reasons for the differences and presents constructive proposals concerning the further development of Hungarian bankruptcy prediction.

Neural networks would 'vote' according to Borda's Rule

Can neural networks learn to select an alternative based on a systematic aggregation of convicting individual preferences (i.e. a 'voting rule')? And if so, which voting rule best describes their behavior? We show that a prominent neural network can be trained to respect two fundamental principles of voting theory, the unanimity principle and the Pareto property. Building on this positive result, we train the neural network on profiles of ballots possessing a Condorcet winner, a unique Borda winner, and a unique plurality winner, respectively. We investigate which social outcome the trained neural network chooses, and find that among a number of popular voting rules its behavior mimics most closely the Borda rule. Indeed, the neural network chooses the Borda winner most often, no matter on which voting rule it was trained. Neural networks thus seem to give a surprisingly clear-cut answer to one of the most fundamental and controversial problems in voting theory: the determination of the most salient election method.