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”.

The model represents an archetypical fishery in a co-evolutionary social-ecological environment, capturing different dimensions of trust between fishers and fish buyers for the establishment and persistence of self-governance arrangements.

This is a simple model replicating Hardin’s Tragedy of the Commons using reactive agents that have psychological behavioral and social preferences.

The SWE models firms search behaviour as the performance landscape shifts. The shift represents society’s pricing of negative externalities, and the performance landscape is an NK structure. The model is written in NetLogo.

The simulation model SimPLS shows an application of the PLS agent concept, using SEM as empirical basis for the definition of agent architectures. The simulation model implements the PLS path model TAM about the decision of using innovative products.

The simulation model LAMDA investigates the influences of varying cognitive abilities of the decision maker on the truth-inducing effect of the Groves mechanism. Bounded rationality concepts are represented by information states and learning models.

The Nice Musical Chairs (NMC) model represent the competition for space between groups of stakeholders of farming and herding activities in the arid Afro-Eurasia.

This model represents technological and ecological behaviors of mobile hunter-gatherers, in a variable environment, as they produce, use, and discard chipped stone artifacts. The results can be analyzed and compared with archaeological sites.

The model is then used for assessing three hypothetical and contrasted infrastructure-oriented adaptation strategies for the winter tourism industry, that have been previously discussed with local stakeholders, as possible alternatives to the “business-as-usual” situation.

This is a replication model of the matching problem including the mate search problem, which is the generalization of a traditional optimization problem.