z-logo
Premium
Analyzing Computational Models
Author(s) -
Siegel David A.
Publication year - 2018
Publication title -
american journal of political science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 6.347
H-Index - 170
eISSN - 1540-5907
pISSN - 0092-5853
DOI - 10.1111/ajps.12364
Subject(s) - computational model , computer science , computational complexity theory , computational problem , game theory , closing (real estate) , theoretical computer science , management science , mathematical economics , artificial intelligence , algorithm , mathematics , political science , law , economics
Computational models have been underutilized as tools for formal theory development, closing off theoretical analysis of complex substantive scenarios that they would well serve. I argue that this occurs for two reasons, and provide resolutions for each. First, computational models generally do not employ the language or modes of analysis common to game‐theoretic models, the status quo in the literature. I detail the types of insights typically derived from game‐theoretic models and discuss analogues in computational modeling. Second, there are not widely established procedures for analysis of deductive computational models. I present a regularized method for deriving comparative statics from computational models that provides insights comparable to those arising from game‐theoretic analyses. It also serves as a framework for building theoretically tractable computational models. Together, these contributions should enhance communication between models of social science and open up the tool kit of deductive computational modeling for theory building to a broader audience.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here