THE COMPLEXITY OF SIMPLICITY

Authors
KEUZENKAMP HA MCALEER M
Citation
Ha. Keuzenkamp et M. Mcaleer, THE COMPLEXITY OF SIMPLICITY, Mathematics and computers in simulation, 43(3-6), 1997, pp. 553-561
Citations number
18
Categorie Soggetti
Computer Sciences",Mathematics,"Computer Science Interdisciplinary Applications","Computer Science Software Graphycs Programming
Journal title
Mathematics and computers in simulation → ACNP
ISSN journal
03784754
Volume
43
Issue
3-6
Year of publication
1997
Pages
553 - 561
Database
ISI
SICI code
0378-4754(1997)43:3-6<553:TCOS>2.0.ZU;2-8
Abstract
This paper is concerned with the practical problems associated with un derstanding and defining the concept of simplicity. Different attempts that have been made to define simplicity and, in particular, definiti ons based on counting parameters, are discussed and analyzed. The limi tations of these attempts, especially as applied to economics, are ill ustrated by means of several econometric examples, including single-eq uation models, systems of equations, alternative functional forms, and probability distributions.