Computational Model Library

Displaying 10 of 161 results for "Jesús M Zamarreño" clear search

ViSA 2.0.0 is an updated version of ViSA 1.0.0 aiming at integrating empirical data of a new use case that is much smaller than in the first version to include field scale analysis. Further, the code of the model is simplified to make the model easier and faster. Some features from the previous version have been removed.
It simulates decision behaviors of different stakeholders showing demands for ecosystem services (ESS) in agricultural landscape. It investigates conditions and scenarios that can increase the supply of ecosystem services while keeping the viability of the social system by suggesting different mixes of initial unit utilities and decision rules.

A simplified Arthur & Polak logic circuit model of combinatory technology build-out via incremental development. Only some inventions trigger radical effects, suggesting they depend on whole interdependent systems rather than specific innovations.

This model uses ’satisficing’ as a model for farmers’ decision making to learn about influences of alternative decision-making models on simulation results and to exemplify a way to transform a rather theoretical concept into a feasible decision-making model for agent-based farming models.

The model implements a double auction financial markets with two types of agents: rational and noise. The model aims to study the impact of different compensation structure on the market stability and market quantities as prices, volumes, spreads.

Exploring how learning and social-ecological networks influence management choice set and their ability to increase the likelihood of species coexistence (i.e. biodiversity) on a fragmented landscape controlled by different managers.

We present a network agent-based model of ethnocentrism and intergroup cooperation in which agents from two groups (majority and minority) change their communality (feeling of group solidarity), cooperation strategy and social ties, depending on a barrier of “likeness” (affinity). Our purpose was to study the model’s capability for describing how the mechanisms of preexisting markers (or “tags”) that can work as cues for inducing in-group bias, imitation, and reaction to non-cooperating agents, lead to ethnocentrism or intergroup cooperation and influence the formation of the network of mixed ties between agents of different groups. We explored the model’s behavior via four experiments in which we studied the combined effects of “likeness,” relative size of the minority group, degree of connectivity of the social network, game difficulty (strength) and relative frequencies of strategy revision and structural adaptation. The parameters that have a stronger influence on the emerging dominant strategies and the formation of mixed ties in the social network are the group-tag barrier, the frequency with which agents react to adverse partners, and the game difficulty. The relative size of the minority group also plays a role in increasing the percentage of mixed ties in the social network. This is consistent with the intergroup ties being dependent on the “arena” of contact (with progressively stronger barriers from e.g. workmates to close relatives), and with measures that hinder intergroup contact also hindering mutual cooperation.

This is the R code of the mathematical model that includes the decision making formulations for artificial agents. This code corresponds to equations 1-70 given in the paper “A Mathematical Model of The Beer Game”.

This is the R code of the mathematical model used for verification. This code corresponds to equations 1-9, 15-53, 58-62, 69-70, and 72-75 given in the paper “A Mathematical Model of The Beer Game”.

code for graphical output

Mert Edali Hakan Yasarcan | Published Wednesday, November 05, 2014

This is the R code of the mathematical model that includes the decision making formulations for artificial agents. Plus, the code for graphical output is also added to the original code.

Displaying 10 of 161 results for "Jesús M Zamarreño" clear search

This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.
Accept