LAUSR

Agent-based models are nowadays widely used; however, their calibration on real data still remains an open issue which prevents to exploit completely their potentiality. Rarely such a kind of models can be studied analytically; more often they are studied by simulation. Among the problems encountered in ABM calibration, the choice of the criteria to fit can appear arbitrary. Markov chain analysis can come through to identify a standard procedure able to face this issue. Indeed, Izquierdo et al. (J Artif Soc Soc Simul 12(16):1–6, 2009) show that many computer simulation models can be represented as Markov chains. Exploiting such an idea classical minimum distance and its simulated counterpart, i.e., simulated minimum distance, are discussed theoretically and applied to Kirman model, which can be reformulated as a Markov chain. Comparison with approximate Bayesian computation is also addressed.