Article

A Common Protocol for Agent-Based Social Simulation

Journal of Artificial Societies and Social Simulation, The (Impact Factor: 1.16). 01/2006; 9.
Source: RePEc

ABSTRACT Traditional (i.e. analytical) modelling practices in the social sciences rely on a very well established, although implicit, methodological protocol, both with respect to the way models are presented and to the kinds of analysis that are performed. Unfortunately, computer-simulated models often lack such a reference to an accepted methodological standard. This is one of the main reasons for the scepticism among mainstream social scientists that results in low acceptance of papers with agent-based methodology in the top journals. We identify some methodological pitfalls that, according to us, are common in papers employing agent-based simulations, and propose appropriate solutions. We discuss each issue with reference to a general characterization of dynamic micro models, which encompasses both analytical and simulation models. In the way, we also clarify some confusing terminology. We then propose a three-stage process that could lead to the establishment of methodological standards in social and economic simulations.

1 Follower
 · 
120 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Publisher’s description: Artificial economics aims to provide a generative approach to understanding problems in economics and social sciences. It is based on the consistent use of agent-based models and computational techniques. It encompasses a rich variety of techniques that generalize numerical analysis, mathematical programming, and micro-simulations. The peer-reviewed contributions in this volume address applications of artificial economics to markets and trading, auctions, networks, management, industry sectors, macroeconomics, and demographics and culture. The articles of this volume will be announced individually.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Consumer search models inherently require substantial computation on behalf of the agents involved. Consumers must derive their optimal search decision, and firms must solve their own profit maximization problems -each subject to the others' behavior. For sequential consumer search models, the iterative nature of the search process lends the study of such models naturally to computational methods, particularly when addi-tional information constraints or strategic interactions are ultimately of interest. This chapter presents an introduction to sequential consumer search models and an appli-cation of Genetic Algorithms to the analysis of such models. A detailed description and example of Genetic Algorithm coding for sequential consumer search is provided, as well as a comparison of simulated equilibria to those of the theoretical search lit-erature. I then extend this initial algorithm to incorporate additional information con-straints, including: (1) restrictions to consumers' ex ante information structures; and (2) limited consumer recall (i.e., buyers do not fully recall their entire search history or the prices/products they have seen). The goal of this Chapter is therefore two-fold: (1) provide a clear link between consumer search theory and computational methods; and (2) illustrate the breadth of application of these methods to more complicated in-formation structures.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: As one of the most important urban commuter transportation modes, urban rail transit (URT) has been acting as a key solution for supporting mobility needs in high-density urban areas. However, in recent years, high frequency of unexpected events has caused serious service disruptions in URT system, greatly harming passenger safety and resulting in severe traffic delays. Therefore, there is an urgent need to study emergency evacuation problem in URT. In this paper, a method of bus dynamic coscheduling is proposed and two models are built based on different evacuation destinations including URT stations and surrounding bus parking spots. A dynamic coscheduling scheme for buses can be obtained by the models. In the model solution process, a new concept-the equivalent parking spot-is proposed to transform the nonlinear model into an integer linear programming (ILP) problem. A case study is conducted to verify the feasibility of models. Also, sensitivity analysis of two vital factors is carried out to analyze their effects on the total evacuation time. The results reveal that the designed capacity of buses has a negative influence on the total evacuation time, while an increase in the number of passengers has a positive effect. Finally, some significant optimizing strategies are proposed.
    Computational Intelligence and Neuroscience 11/2014; 2014:174369. DOI:10.1155/2014/174369

Full-text (3 Sources)

Download
69 Downloads
Available from
May 29, 2014